Ciphertext Secure Public-Key Encryption Ronald Cramer Victor Shoup December...  Home/Search
Context
Related
| iacr.org/2001/085.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present several new and fairly practical public-key encryption schemes and prove them secure against adaptive chosen ciphertext attack. One scheme is based on Paillier's Decision Composite Residuosity (DCR) assumption, while another is based in the classical Quadratic Residuosity (QR) assumption. The analysis is in the standard cryptographic model, i.e., the security of our schemes does not rely on the Random Oracle model. (Update)
Similar documents (at the sentence level):
18.6%: Universal Hash Proofs and a Paradigm for Adaptive Chosen.. - Cramer, Shoup (2001) (Correct)
7.8%: Research Reports on - Mathematical And Computing (Correct)
Active bibliography (related documents): More All
0.2: A Framework for Password-Based Authenticated Key Exchange - Gennaro, Lindell (2003) (Correct)
0.2: Multi-trapdoor Commitments and their Applications to Proofs of.. - Gennaro (2004) (Correct)
0.0: Another Look At Generic Groups - Neal Koblitz And (2006) (Correct)
Similar documents based on text: More All
0.4: A Practical Public Key Cryptosystem Provably Secure against.. - Cramer, Shoup (1998) (Correct)
0.3: Design and Analysis of Practical Public-Key Encryption Schemes .. - Cramer, Shoup (2001) (Correct)
0.2: Signature Schemes Based on the Strong RSA Assumption - Cramer, Shoup (1998) (Correct)
BibTeX entry: (Update)
@misc{ public-key-universal,
author = "Ciphertext Secure Public-Key",
title = "Universal Hash Proofs and a Paradigm for Adaptive Chosen",
url = "citeseer.ist.psu.edu/724587.html" }
Citations (may not include all citations):659 Random oracles are practical: a paradigm for designing e- ci.. - Bellare, Rogaway - 1993
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
326 Non-malleable cryptography - Dolev, Dwork et al. - 1991
208 Universal one-way hash functions and their cryptographic app.. - Naor, Yung - 1989
191 New hash functions and their use in authentication and set e.. (context) - Wegman, Carter - 1981
177 Public-key cryptosystems provably secure against chosen ciph.. - Naor, Yung - 1990
162 Public-key cryptosystems based on composite degree residue c.. - Paillier - 1999
131 Non-interactive zero knowledge proof of knowledge and chosen.. (context) - Racko, Simon - 1991
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996
28 The random oracle model (context) - Canetti, Goldreich et al. - 1998
5 A practical public key cryptosystem secure against adaptive .. (context) - Cramer, Shoup - 1998
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC