1446 search results - page 18 / 290 » Local zero knowledge |
193
click to vote
ASIACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
161
Voted
COCO
1991
Springer
15 years 10 months ago
1991
Springer
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
112
Voted
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
189
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
171
click to vote
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...