773 search results - page 44 / 155 » On Cryptographic Assumptions and Challenges |
122
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
127
click to vote
ACISP
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
123
click to vote
CRYPTO
2011
Springer
14 years 1 months ago
2011
Springer
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
101
click to vote
PROVSEC
2009
Springer
15 years 8 months ago
2009
Springer
This paper explains how to design fully secure RSA-type cryptosystems from schemes only secure against passive attacks, in the standard model. We rely on instance-independence assu...
102
click to vote
ECAL
2005
Springer
15 years 7 months ago
2005
Springer
One of the greatest challenges in the modern biological and social sciences has been to understand the evolution of altruistic and cooperative behaviors. General outlines of the an...