24 search results - page 4 / 5 » Hardness Preserving Constructions of Pseudorandom Functions |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...
EUROCRYPT
2010
Springer
13 years 11 months ago
2010
Springer
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...
PKC
2012
Springer
11 years 8 months ago
2012
Springer
We initiate the study of security for key-dependent messages (KDM), sometimes also known as “circular” or “clique” security, in the setting of identity-based encryption (I...
ASIACRYPT
2009
Springer
14 years 25 days 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...
ICS
2010
Tsinghua U.
14 years 3 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...