Sciweavers

120 search results - page 13 / 24
» Construction of a Non-malleable Encryption Scheme from Any S...
Sort
View
EUROCRYPT
2010
Springer
14 years 9 days ago
Bounded Key-Dependent Message Security
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 ...
Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval...
EUROCRYPT
2010
Springer
14 years 9 days ago
A Simple BGN-Type Cryptosystem from LWE
We construct a simple public-key encryption scheme that supports polynomially many additions and one multiplication, similar to the cryptosystem of Boneh, Goh, and Nissim (BGN). S...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
ICALP
2005
Springer
14 years 1 months ago
On Steganographic Chosen Covertext Security
At TCC 2005, Backes and Cachin proposed a new and very strong notion of security for public key steganography: secrecy against adaptive chosen covertext attack (SS-CCA); and posed ...
Nicholas Hopper
ACNS
2005
Springer
94views Cryptology» more  ACNS 2005»
14 years 1 months ago
Optimal Asymmetric Encryption and Signature Paddings
Strong security notions often introduce strong constraints on the construction of cryptographic schemes: semantic security implies probabilistic encryption, while the resistance to...
Benoît Chevallier-Mames, Duong Hieu Phan, Da...
JCS
2010
112views more  JCS 2010»
13 years 6 months ago
Inductive trace properties for computational security
Protocol authentication properties are generally trace-based, meaning that authentication holds for the protocol if authentication holds for individual traces (runs of the protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...