82 search results - page 15 / 17 » Distributed Public-Key Cryptography from Weak Secrets |
FSE
2003
Springer
14 years 25 days ago
2003
Springer
In this paper, we investigate the security, in the Luby-Rackoff security paradigm, of blockcipher modes of operation allowing to expand a one-block input into a longer t-block ou...
FOCS
2002
IEEE
14 years 17 days ago
2002
IEEE
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
PKC
2012
Springer
11 years 10 months ago
2012
Springer
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
SASN
2004
ACM
14 years 1 months ago
2004
ACM
Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Recently, several...