Paper Info
Title
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract
The generic group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Although generic hardness proofs exhibit many similarities, still the computational intractability of every newly introduced problem needs to be proven from scratch, a task that can easily become complicated and cumbersome when done rigorously. In this paper we make the first steps towards overcoming this problem by identifying criteria which guarantee the hardness of a problem in an extended generic model where algorithms are allowed to perform any operation representable by a polynomial function.
Year
DOI
Venue
2008
10.1007/978-3-540-89255-7_30
IACR Cryptology ePrint Archive
Keywords
DocType
Volume
dh problems,valuable methodology,computational hardness,proofs exhibit,polynomial function,generalized dl,extended generic model,generic hardness,operation representable,sufficient conditions,generic lower bounds,generic group model,lower bounds.,number-theoretic problem,black-box groups,straight-line programs,hardness conditions,computational intractability,generic algorithm,lower bound,upper bound,satisfiability
Conference
2007
ISSN
Citations 
PageRank 
0302-9743
9
0.48
References 
Authors
19
5
Name
Order
Citations
PageRank
Andy Rupp119616.95
Gregor Leander2128777.03
Endre Bangerter330314.50
Alexander W. Dent445425.15
Ahmad-reza Sadeghi55463334.69