370 search results - page 38 / 74 » Limits of Constructive Security Proofs |
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
CRYPTO
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic enco...
WISA
2009
Springer
14 years 2 months ago
2009
Springer
Power analysis has shown to be successful in breaking symmetric cryptographic algorithms implemented on low resource devices. Prompted by the breaking of many protected implementat...
PKC
2010
Springer
14 years 2 days ago
2010
Springer
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...