See this document in CiteSeerX!

Optimal Asymmetric Encryption (1994)  (Make Corrections)  (165 citations)
Mihir Bellare, Phillip Rogaway
Lecture Notes in Computer Science



  Home/Search   Context   Related

Links:   DBLP

 
View or download:
nctu.edu.tw/research/crypto/HT...92.PDF
Cached:  PS.gz  PS  PDF   Image  Update  Help
Problem Downloading?
From:  nctu.edu.tw/research/cr...AUTHORS (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Given an arbitrary k-bit to k-bit trapdoor permutation f and a hash function, we exhibit an encryption scheme for which (i) any string z of length slightly less than k bits can be encrypted as where r= is a simple probabilistic encoding of z depending on the hash function; and (ii) the scheme can be proven semantically secure assuming the hash function is "ideal." Moreover, a slightly enhanced scheme is shown to have the property that the adversary can create ciphertexts only of strings... (Update)

Cited by:   More
Code-Based Game-Playing Proofs and the Security of Triple.. - Bellare, Rogaway (2006)   (Correct)
Appears in Advances in Cryptology -- Eurocrypt 96.. - The Exact Security   (Correct)
A Generic Construction of CCA-Secure Cryptosystems without .. - Goichiro Hanaoka And   (Correct)

Similar documents (at the sentence level):
46.7%:   A New Suggestion for How to Encrypt with RSA - Bellare, Rogaway (1994)   (Correct)

Similar documents based on text:   More   All
0.4:   On the Construction of Variable-Input-Length Ciphers - Bellare, Rogaway (1999)   (Correct)
0.4:   DHAES: An Encryption Scheme Based on the Diffie-Hellman.. - Abdalla, Bellare, Rogaway (1998)   (Correct)
0.4:   Efficient Public-Key Cryptosystems Provably Secure against .. - Paillier, Pointcheval (1999)   (Correct)

Related documents from co-citation:   More   All
54:   Random Oracles are Practical: a Paradigm for Designing Efficient Protocols - Bellare, Rogaway - 1993
40:   Non-malleable cryptography - Dolev, Dwork et al. - 1991
38:   A method for obtaining digital signatures and public-key cryptosystems; Communic.. - Rivest, Shamir et al. - 1978

BibTeX entry:   (Update)

M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology--- Crypto '94, pages 92--111, 1994. http://citeseer.ist.psu.edu/bellare94optimal.html   More

@article{ bellare95optimal,
    author = "Mihir Bellare and Phillip Rogaway",
    title = "Optimal Asymmetric Encryption",
    journal = "Lecture Notes in Computer Science",
    volume = "950",
    pages = "92--111",
    year = "1995",
    url = "citeseer.ist.psu.edu/bellare94optimal.html" }
Citations (may not include all citations):
1   It then initializes two lists (context) - by, from et al.
1   such that y (context) - is
1   con- structs the string Wh (context) - G-query, for et al.
1   and returns Gg to (context) - are, that et al.



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://dsns.csie.nctu.edu.tw/research/crypto/HTML/AUTHORS.HTM):   More
One-Way Accumulators: A Decentralized Alternative to Digital .. - Benaloh, De Mare (1994)   (Correct)
Information-Theoretically Secure Secret-Key Agreement by NOT.. - Maurer (1997)   (Correct)
How To Prove Yourself: Practical Solutions to Identification.. - Fiat, Shamir (1987)   (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