1. Reductionist Security Arguments for Public-Key Cryptographic Schemes Based on Group Action.
- Author
-
Stolbunov, Anton
- Subjects
PUBLIC key cryptography ,COMPUTER network protocols ,HASHING ,DATA protection ,COMPUTER security ,GROUP actions (Mathematics) - Abstract
We provide reductionist security arguments for a key agreement protocol KA, which is the Diffie-Hellman key agreement protocol generalized to the context of a group action on a set, and for a public-key encryption scheme PE, which is the "hashed" ElGamal scheme generalized for a group action on a set. For the KA protocol we use the notion of session key security in the authenticated links model, proposed by Canetti and Krawczyk. For the PE scheme we use a version of the semantic security notion proposed by Goldwasser and Micali. We prove that the security of the KA protocol and the PE scheme is based on the decisional Diffie-Hellman group action problem, defined later in this paper. The PE scheme security also depends on the entropy smoothing property of the hash function family used in the scheme. [ABSTRACT FROM AUTHOR]
- Published
- 2009