Shaoquan Jiang  Home/Search
Context
Related
| iacr.org/2006/046.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: Since Diffie-Hellman [14], many secure systems, based on discrete logarithm or Diffie-Hellman assumption in Z_p, were introduced in the literature. In this work, we investigate the possibility to construct efficient primitives from exponentiation techniques over Z_p. Consequently, we propose a new pseudorandom generator, where its security is proven under the decisional Diffie-Hellman assumption. Our generator is the most efficient among all generators from Z*_p that are provably secure under... (Update)
Active bibliography (related documents): More All
0.7: On the Provable Security of an Efficient RSA-Based.. - Steinfeld, Pieprzyk.. (2006) (Correct)
0.6: An Improved Pseudorandom Generator Based on Hardness of.. - Dedic, Reyzin, Vadhan (2002) (Correct)
0.5: Discrete Logarithms in Finite Fields and Their Cryptographic.. - Odlyzko (1984) (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ jiang-ecient,
author = "Shaoquan Jiang",
title = "Efficient Primitives from Exponentiation in $Z_p$",
url = "citeseer.ist.psu.edu/jiang06efficient.html" }
Citations (may not include all citations):1529 A Method for Obtaining Digital Signatures and Public-key Cry.. - Rivest, Shamir et al. - 1978
501 A Digital Signature Scheme Secure Against Adaptive Chosen-Me.. - Goldwasser, Micali et al. - 1988
419 How to Construct Random Functions (context) - Goldreich, amd et al. - 1986
339 Theory and Applications of Trapdoor Functions (context) - Yao - 1982
334 How to Generate Cryptographically Strong Sequences of Pseudo.. (context) - Blum, Micali - 1982
254 a practical public-key cryptosystem provably secure against .. - Cramer, Shoup - 1998
186 a public-key cryptosystem and a signature scheme based on di.. (context) - Gamal - 1985
128 A Subexponential Algorithm for the Discrete Logarithm Proble.. (context) - Adleman - 1979
112 IEEE Transactions on Information Theory (context) - Di and, Hellman et al. - 1976
103 A Simple Unpredictable Pseudo-Random Number Generator (context) - Blum, Blum et al. - 1986
99 Foundations of Cryptography: Basic Tools (context) - Goldreich - 2001
90 A Pseudorandom Generator from any One-way Function - Hastad, Impagliazzo et al. - 1999
56 Collision Free Hash Functions and Public Key Signature Schem.. (context) - Damgard - 1987
51 analysis of key-exchange protocols and their use for buildin.. - Canetti, Krawczyk - 2001
42 Introduction to Number Theory (context) - Hua - 1982
36 More Flexible Exponentiation with Precomputation - Lim, Lee - 1994
36 universally composable notions of key exchange and secure ch.. - Canetti, Krawczyk - 2002
35 Discrete Logarithms in GF (context) - Coppersmith, Odlyzko et al. - 1986
34 A New Paradigm for Collision-Free Hashing: Incrementality at.. (context) - Bellare, Micciancio - 1997
24 The Discrete Logarithm Modulo a Composite Hides O (context) - Hastad, Schrift et al. - 1993
22 Verifiable Partial Key Escrow - Bellare, Goldwasser - 1997
21 Why and how to establish a private code on a public network (context) - Goldwasser, Micali et al.
21 cient password-authenticated key exchange using human-memora.. (context) - Katz, Ostrovsky et al. - 2001
13 An Improved Pseudo-random Generator Based on the Discrete Lo.. - Gennaro - 2000
11 security analysis of IKE's signature-based keyexchange proto.. - Canetti, Krawczyk - 2002
10 Finding Collisions in Full SHA (context) - Wang, Yin et al. - 2005
8 the Security of Modular Exponentiation with Application to t.. - Goldreich, Rosen - 2003
8 How to Break MD5 and Other Hash Functions (context) - Wang, Yu - 2005
6 Discrete Logarithms: The Past and the Future - Odlyzko - 2000
5 cient and Secure Pseudo-random number generation (context) - Vazirani, Vazirani
5 password based key exchange with mutual authentication - Jiang, Gong - 2005
5 HMQV: A High-Performance Secure Di#e-Hellman Protocol (context) - Krawczyk - 2005
4 cient Discrete Log Pseudo Random Generator (context) - Patel, Sundaram - 1998
4 Cryptanalysis of the Hash Functions MD4 and RIPEMD (context) - Wang, Lai et al. - 2005
4 The Composite Discrete Logarithm and Secure Authentication (context) - Pointcheval - 2000
2 How Discreet is the Discrete Log (context) - Long, Wigderson - 1983
2 RSARabin Bit are + poly (context) - Goldreich, Rabin et al. - 1984
1 cient and Provable Collision Resistant Hash Function (context) - Contini, Lenstra et al. - 2005
1 cient Collision-Resistant Hashing From Worst-Case Assumption.. (context) - Peikert, Rosen - 2006
1 An Improved Pseudorandom Generator Based on Hardness of Fact.. - Dedic, Reyzin et al. - 2003
1 the Developement of the Number Field Sieve (context) - Lenstra, Lenstra et al. - 1993
1 Advances in Cryptology-EUROCRYPT (context) - Shoup, for et al. - 1997
1 Philosophical Transactions: Physical Science and Engineering (context) - Schirokauer, Logarithm et al. - 1993
1 Advances in Cryptology-CRYPTO (context) - Shamir, Tauman et al. - 2001
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