Amitabh Saxena and Ben Soh Email: {asaxena, ben}@cs.latrobe.edu.au Department ...  Home/Search
Context
Related
| iacr.org/2006/178.pdf 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/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Let G1 be a cyclic multiplicative group of order n. It is known that the Di#e-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if #(n) is known. That is, given g, g G1 and having oracle access to a "Di#e-Hellman Problem solver" with fixed generator g, it is possible to compute g G1 in polynomial time (see theorem 3.2). On the other hand, it is not known if such a reduction exists when #(n) is unknown (see conjuncture 3.1). We exploit this "gap" to construct a... (Update)
Active bibliography (related documents): More All
1.3: The Cryptographic Impact of Groups with Infeasible Inversion - Hohenberger (2003) (Correct)
0.8: Low Ambiguity in Strong, Total, Associative, One-Way Functions - Homan (2000) (Correct)
0.7: Overview of Key Agreement Protocols - Dutta, Barua (2005) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ cryptoeprint:2006:178,
author = {Amitabh Saxena and Ben Soh},
title = {A New Cryptosystem Based On Hidden Order Groups},
howpublished = {Cryptology ePrint Archive, Report 2006/178},
year = {2006},
note = {\url{http://eprint.iacr.org/}},
url = {citeseer.ist.psu.edu/758786.html} }
Citations (may not include all citations):1529 A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978
1065 Handbook of Applied Cryptography (context) - Menezes, Vanstone et al. - 1996
337 Identity-based encryption from the Weil pairing - Boneh, Franklin - 2003
239 Blind signatures for untraceable payments (context) - Chaum - 1982
193 Short signatures from the Weil pairing - Boneh, Lynn et al. - 2001
162 Public-key cryptosystems based on composite degree residuosi.. - Paillier - 1999
112 IEEE Transactions on Information Theory (context) - Di and, Martin et al. - 1976
109 Digitalized signatures and public-key functions as intractab.. (context) - Rabin - 1979
108 Secure integration of asymmetric and symmetric encryption sc.. - Fujisaki, Okamoto - 1999
108 A one round protocol for tripartite Di#e-Hellman (context) - Joux - 2000
63 CLIQUES: A new approach to group key agreement - Steiner, Tsudik et al. - 1998
55 cient algorithms for pairing-based cryptosystems (context) - Barreto, Kim et al. - 2002
50 Separating Decision Di#e-Hellman from Di#e-Hellman in crypto.. - Joux, Nguyen - 2001
33 Lecture Notes in Computer Science (context) - Fiat, Naor - 1994
27 Applications of multilinear forms to cryptography - Boneh, Silverberg - 2002
23 the complexity of matrix group problems (context) - Babai, Szemeredi - 1984
16 Evaluating 2-DNF formulas on ciphertexts (context) - Boneh, Goh et al. - 2005
10 Lecture Notes in Computer Science (context) - Rivest, Shamir et al. - 2001
10 Information-theoretic cryptography (context) - Maurer - 1999
9 The bit security of Paillier's encryption scheme and its app.. (context) - Catalano, Gennaro et al. - 2001
7 An observation on associative one-way functions in complexit.. (context) - Rabi, Sherman - 1997
7 Constant-round authenticated group key exchange for dynamic .. (context) - Kim, Lee et al. - 2004
7 A survey of key management for secure group communication (context) - Rafaeli, Hutchison - 2003
6 Springer-Verlag New York (context) - Koblitz, in et al. - 1987
5 the notion of pseudo-free groups - Rivest - 2004
5 Public traceability in traitor tracing schemes (context) - Chabanne, Phan et al. - 2005
5 Associative one-way functions: A new paradigm for secret-key.. - Rabi, Sherman - 1993
5 Mutual authentication and group key agreement for low-power .. - Bresson, Chevassut et al. - 2003
4 associative one-way functions from any one-way function in c.. (context) - Hemaspaandra, Rothe et al. - 1999
3 Paillier's trapdoor function hides up to O (context) - Catalano, Gennaro et al. - 2002
3 The cryptographic impact of groups with infeasible inversion - Hohenberger - 2003
3 A novel method for authenticating mobile agents with one-way.. (context) - Saxena, Soh - 2005
3 Attacks on Bresson-Chevassut-Essiari-Pointcheval's group key.. - Nam, Kim et al. - 2004
2 NP then some strongly noninvertible functions are invertible (context) - Hemaspaandra, Pasanen et al. - 2001
2 Low ambiguity in strong (context) - Homan - 2000
2 One-way functions in worst-case cryptography: Algebraic and .. - Beygelzimer, Hemaspaandra et al. - 1999
1 aandra, Jorg Rothe, and Amitabh Saxena. Enforcing and defyin.. (context) - Hemasp - 2005
1 Secure Group Communications Over Data Networks (context) - Zou, Ramamurthy et al. - 2005
1 Hidden pairings and trapdoor DDH groups (context) - Dent, Galbraith - 2006
1 Is the Data Encryption Standard a group (context) - Kaliksi, Ronald et al. - 1988
1 Detecting and exploiting algebraic weaknesses in cryptosyste.. (context) - Sherman, VLSI et al. - 1986
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (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