Sciweavers

CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
13 years 11 months ago
Secure Hybrid Encryption from Weakened Key Encapsulation
We put forward a new paradigm for building hybrid encryption schemes from constrained chosen-ciphertext secure (CCCA) key-encapsulation mechanisms (KEMs) plus authenticated symmet...
Dennis Hofheinz, Eike Kiltz
CISC
2007
Springer
152views Cryptology» more  CISC 2007»
13 years 11 months ago
Orthogonality between Key Privacy and Data Privacy, Revisited
Abstract. Key privacy is a notion regarding the privacy of the owner of a public key, which has important applications in building (receiver) anonymous channels, or privacy-enhance...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai
AFRICACRYPT
2008
Springer
13 years 11 months ago
A Brief History of Provably-Secure Public-Key Encryption
Public-key encryption schemes are a useful and interesting field of cryptographic study. The ultimate goal for the cryptographer in the field of public-key encryption would be th...
Alexander W. Dent
PROVSEC
2009
Springer
13 years 11 months ago
Chosen-Ciphertext Secure RSA-Type Cryptosystems
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...
Benoît Chevallier-Mames, Marc Joye
CRYPTO
2009
Springer
166views Cryptology» more  CRYPTO 2009»
13 years 11 months ago
Public-Key Cryptosystems Resilient to Key Leakage
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
Moni Naor, Gil Segev
ASIACRYPT
2009
Springer
13 years 11 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan
FOCS
2009
IEEE
13 years 11 months ago
Bit Encryption Is Complete
Abstract— Under CPA and CCA1 attacks, a secure bit encryption scheme can be applied bit-by-bit to construct a secure many-bit encryption scheme. The same construction fails, howe...
Steven Myers, Abhi Shelat
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
13 years 11 months ago
Fully homomorphic encryption using ideal lattices
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
Craig Gentry
DCC
2005
IEEE
14 years 4 months ago
Signcryption with Non-interactive Non-repudiation
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...
John Malone-Lee