397 search results - page 74 / 80 » Pseudorandom Functions and Lattices |
86
Voted
CCS
2004
ACM
15 years 2 months ago
2004
ACM
We expose privacy issues related to Radio Frequency Identification (RFID) in libraries, describe current deployments, and suggest novel architectures for library RFID. Libraries ...
IEICET
2006
14 years 9 months ago
2006
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
115
Voted
TC
2010
14 years 4 months ago
2010
Tweakable enciphering schemes are length preserving block cipher modes of operation that provide a strong pseudo-random permutation. It has been suggested that these schemes can b...
79
Voted
ICFP
2004
ACM
15 years 9 months ago
2004
ACM
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
We present a polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. The Q-Ising, one of the generalized models of the Ising, arose in the context of Baye...