397 search results - page 53 / 80 » Pseudorandom Functions and Lattices |
101
click to vote
CRYPTO
2005
Springer
15 years 6 months ago
2005
Springer
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
118
click to vote
SACRYPT
2005
Springer
15 years 6 months ago
2005
Springer
The ability to link two different sightings of the same Radio Frequency Identification (RFID) tag enables invasions of privacy. The problem is aggravated when an item, and the ta...
105
click to vote
STOC
1997
ACM
15 years 5 months ago
1997
ACM
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
137
click to vote
PAIRING
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
107
click to vote
CRYPTO
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...