Siguna Müller  Home/Search
Context Related
| cacr.math.uwaterloo.ca...corr200005.ps 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: cacr.math.uwaterlo...tech_reports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Motivated by some strong and interesting cryptographic properties of the intrinsic structure of Williams' encryption scheme [36], we present a practical modification thereof that can be proven secure against adaptive chosen-ciphertext attacks. While our proof applies a notion of security closely related to the strong concept of `plaintext-awareness' [4], we do not require the use of random oracles. To this end, we introduce a comparable notion and prove the security without relying on the ROM.... (Update)
Similar documents based on text: More All
1.1: Securing Threshold Cryptosystems against Chosen Ciphertext Attack - Shoup, Gennaro (1997) (Correct)
0.5: On Chosen Ciphertext Security of Multiple Encryptions - Goldreich, Lustig, Naor (2002) (Correct)
0.5: Public Key Trace and Revoke Scheme Secure against Adaptive.. - Dodis, Fazio (2003) (Correct)
BibTeX entry: (Update)
Siguna Muller. On the security of a Williams based public key encryption scheme. In Kwangjo Kim, editor, 4th International Workshop on Practice and Theory in Public Key Cryptography (PKC 2001. http://citeseer.ist.psu.edu/muller00security.html More
@misc{ ller-security,
author = "Siguna M{\"u}ller",
title = "On the Security of a Williams Based Public Key Encryption Scheme",
url = "citeseer.ist.psu.edu/muller00security.html" }
Citations (may not include all citations):1529 A method for obtaining digital signatures and publickey cryp.. - Rivest, Shamir et al. - 1978
1065 Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1997
659 Random oracles are practical: A paradigm for designing ecien.. - Bellare, Rogaway - 1993
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali et al. - 1984
326 Non-malleable cryptography - Dolev, Dwork et al. - 1991
260 Relations among notions of security for public-key encryptio.. (context) - Bellare, Desai et al. - 1998
177 Public-key cryptosystems provably secure against chosen ciph.. - Naor, Yung - 1990
131 Non-interactive zero-knowledge proofs of knowledge and chose.. (context) - Racko, Simon - 1991
119 Chosen Ciphertext Attacks Against Protocols Based on the RSA.. - Bleichenbacher - 1998
118 Optimal asymmetric encryption { How to encrypt with RSA (context) - Bellare, Rogaway - 1995
105 Secure Hash-and-Sign Signatures without the Random Oracle - Gennaro, Halevi et al. - 1999
68 Low-Exponent RSA with Related Messages - Coppersmith, Franklin et al. - 1996
42 Towards Realizing Random Oracles: Hash Functions That Hide A.. - Canetti
39 Using Hash Functions as a Hedge against Chosen Ciphertext At.. - Shoup
34 Breaking RSA May Not Be Equivalent to Factoring (context) - Boneh, Venkatesan - 1998
[Article contains additional citations not shown here]
Documents on the same site (http://www.cacr.math.uwaterloo.ca/tech_reports.html): More
Efficient Metering Schemes with Pricing - Masucci, Stinson (2000) (Correct)
Speeding up the Arithmetic on Koblitz Curves of Genus Two - Günther, Lange, Stein (2000) (Correct)
Baby-Step Giant-Step Algorithms For Non-Uniform Distributions - Blackburn, Teske (2000) (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