The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols

By Mihir Bellare, Adriana Palacio. 2004

272 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Pinocchio: Nearly Practical Verifiable Computation (2013, background): “of cryptographic assumptions that do not lend themselves to efficient falsification [37], though some members have indeed been proven false [38].”
Remote data checking using provable data possession (2011, methodology): “The schemes are based on the KEA1 assumption, which was introduced by Damgard in 1991 [Damgard 1992], and subsequently used by several others, most notably in [Hada and Tanaka 1998; Bellare and Palacio 2004a, 2004b; Krawczyk 2005; Dent 2006a].”
On the existence of extractable one-way functions (2014, methodology): “As an expression of the method’s power, KEA [40, 4], or even general extractable one-way functions [18, 6], are known to suffice for constructing 3-message zero-knowledge protocols, and extractable collision-resistant hash functions are known to suffice for constructing succinct non-interactive argu”
A Privacy-Preserving Remote Data Integrity Checking Protocol with Data Dynamics and Public Verifiability (2011, background): “assumption, which has been investigated in [17], [18], and adapted to the RSA setting in [3].”
Stronger Security of Authenticated Key Exchange (2006, methodology): “Security assumptions include: RO – random oracle model [5], DDH – Decisional Diffie-Hellman, GDH – Gap Diffie-Hellman [19], PDH – Pairing Diffie-Hellman [16] and KEA1 – knowledge of exponent assumption [2].”
Proofs of retrievability: theory and implementation (2009, background): “Filho and Barreto [9] describe a POR scheme that relies on the knowledge-of-exponent assumption, first set forth in [3].”
Pors: proofs of retrievability for large files (2007, unknown): “As it relies on modular exponentiation over files, their approach is computationally intensive, and also relies on a somewhat lightly explored “knowledge-ofexponent” hardness assumption [6] adapted to the RSA set-”
Privacy-Preserving Audit and Extraction of Digital Contents (2008, methodology): “To show soundness, however, we need to rely on the knowledge of exponent assumption (KEA) introduced by Damgard and later refined by others [7].”
Provable data possession at untrusted stores (2007, methodology): “[7] M. Bellare and A. Palacio.”