2432 search results - page 161 / 487 » Cryptographic logical relations |
111
Voted
CCS
2006
ACM
15 years 4 months ago
2006
ACM
Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFS...
113
Voted
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
71
Voted
USS
2008
15 years 3 months ago
2008
Administrative verifiability gives election officials the means to protect against certain kinds of errors and fraud. This is typically accomplished with tools like paper audit tr...
118
click to vote
BIOID
2008
15 years 2 months ago
2008
Abstract. Security and privacy issues are considered as two of the major concerns related to the use of biometric data for authentication purposes. In this paper we propose two dif...
80
Voted
DLT
2007
15 years 2 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...