773 search results - page 1 / 155 » On Cryptographic Assumptions and Challenges |
CRYPTO
2003
Springer
14 years 2 months ago
2003
Springer
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
WDAG
2007
Springer
14 years 3 months ago
2007
Springer
We present the first optimally resilient, bounded, wait-free implementation of a distributed atomic register, tolerating Byzantine readers and (up to one-third of) Byzantine serve...
ICS
2010
Tsinghua U.
14 years 6 months ago
2010
Tsinghua U.
ASIACRYPT
2009
Springer
14 years 4 months ago
2009
Springer
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
CRYPTO
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...