237 search results - page 47 / 48 » On the Security Notions for Public-Key Encryption Schemes |
STOC
1995
ACM
15 years 1 months ago
1995
ACM
The goal of incremental cryptography is to design cryptographic algorithms with the property that having applied the algorithm to a document, it is possible to quickly update the ...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
ECCC
2007
14 years 9 months ago
2007
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
90
Voted
IACR
2011
13 years 9 months ago
2011
Program Obfuscation is the problem of transforming a program into one which is functionally equivalent, yet whose inner workings are completely unintelligible to an adversary. Des...
CCS
2006
ACM
15 years 1 months ago
2006
ACM
We extend the definitional work of Dwork, Naor and Sahai from deniable authentication to deniable key-exchange protocols. We then use these definitions to prove the deniability fe...