Stefan Lucks  Home/Search
Context Related
Links: ACM DBLP | th.informatik.unimannhei...paper165.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: th.informatik.unimannhe...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The Cramer-Shoup cryptosystem for groups of prime order is a practical public-key cryptosystem, provably secure in the standard model under standard assumptions. This paper extends the cryptosystem for groups of unknown order, namely the group of quadratic residues modulo a composed N . (Update)
Cited by: More
Hybrid Cryptography - Dent (2004) (Correct)
Similar documents (at the sentence level):
68.9%: A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown.. - Lucks (2002) (Correct)
20.3%: A Variant of the Cramer-Shoup Cryptosystem for Groups with Unknown .. - Lucks (2002) (Correct)
Active bibliography (related documents): More All
0.5: Extensions to the Paillier Cryptosystem with Applications to.. - Jurik (2003) (Correct)
0.3: Pseudorandom Function Tribe Ensembles Based on One-Way.. - Fischlin (1999) (Correct)
0.3: Simple and Efficient Threshold Cryptosystem from the Gap.. - Baek, Zheng (Correct)
Similar documents based on text: More All
1.5: Design and Analysis of Practical Public-Key Encryption Schemes .. - Cramer, Shoup (2001) (Correct)
1.3: A Practical Public Key Cryptosystem Provably Secure against.. - Cramer, Shoup (1998) (Correct)
0.9: Security of Signed ElGamal Encryption (Extended Abstract) - Schnorr, Jakobsson (2000) (Correct)
Related documents from co-citation: More All
2: cient Signature Generation for Smart Cards (context) - Schnorr - 1991
BibTeX entry: (Update)
S. Lucks. A variant of the Cramer-Shoup cryptosystem for groups of unknown order. In Y. Zheng, editor, Advances in Cryptology -- Asiacrypt 2002. http://citeseer.ist.psu.edu/article/lucks02variant.html More
@misc{ lucks02variant,
author = "S. Lucks",
title = "A variant of the Cramer-Shoup cryptosystem for groups of unknown order",
text = "S. Lucks. A variant of the Cramer-Shoup cryptosystem for groups of unknown
order. In Y. Zheng, editor, Advances in Cryptology -- Asiacrypt 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/article/lucks02variant.html" }
Citations (may not include all citations):31 Rogaway: \Random oracles are practical: a paradigm for desig.. (context) - Bellare
15 Naor: \Non-malleable cryptography (context) - Dolev, Dwork - 2000
10 Rogaway: \Relations among notions of security for public-key.. (context) - Bellare, Desai et al.
8 personal communication (context) - Cramer
8 Simon: \Non-interactive zero knowledge proof of knowledge an.. (context) - Racko
5 Yung: \Public-key cryptosystems provably secure against chos.. (context) - Naor
3 personal communication (context) - Kiltz
2 Shoup: \Universal hash proofs and a paradigm for adaptive ch.. (context) - Cramer - 2002
2 provably secure against chosen ciphertext attacks (context) - Cramer, Shoup et al.
1 Shoup: \Design and analysis of practical public-key encrypti.. (context) - Cramer - 2001
1 Yung: \Key-Insulated Public Key Cryptosystems (context) - Dodis, Katz et al. - 2002
1 Rogaway: \DHAES: an encryption scheme based on the DieHellma.. (context) - Abdalla, Bellare - 1999
1 Springer LNCS (context) - Shoup, functions et al.
Documents on the same site (http://th.informatik.uni-mannheim.de/People/Lucks/papers.html): More
How to Exploit the Intractability of Exact TSP for Cryptography - Lucks (1994) (Correct)
How Traveling Salespersons Prove Their Identity - Lucks (Correct)
Open Key Exchange: How to Defeat Dictionary Attacks Without.. - Lucks (1997) (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