10 search results - page 2 / 2 » On Constructing One-Way Permutations from Indistinguishabili... |
ASIACRYPT
2009
Springer
13 years 12 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...
TCC
2004
Springer
13 years 10 months ago
2004
Springer
We show how to public-key obfuscate two commonly used shuffles: decryption shuffles which permute and decrypt ciphertexts, and re-encryption shuffles which permute and re-encrypt c...
CCS
2005
ACM
13 years 10 months ago
2005
ACM
We investigate whether it is possible to encrypt a database and then give it away in such a form that users can still access it, but only in a restricted way. In contrast to conve...
FOCS
2009
IEEE
14 years 1 hour ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
TCC
2009
Springer
14 years 5 months ago
2009
Springer
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...