An Algebraic Framework for Diffie–Hellman Assumptions

We put forward a new algebraic framework to generalize and analyze Diffie–Hellman like decisional assumptions which allows us to argue about security and applications by considering only algebraic properties. Our D ℓ , k - MDDH Assumption states that it is hard to decide whether a vector in G ℓ is l...

Full description

Saved in:
Bibliographic Details
Published in:Journal of cryptology Vol. 30; no. 1; pp. 242 - 288
Main Authors: Escala, Alex, Herold, Gottfried, Kiltz, Eike, Ràfols, Carla, Villar, Jorge
Format: Journal Article Publication
Language:English
Published: New York Springer US 01.01.2017
Springer Nature B.V
Subjects:
11 Number theory
11Y Computational number theory
Algebra
Classificació AMS
Coding and Information Theory
Columns (structural)
Combinatorics
Communications Engineering
Computational Mathematics and Numerical Analysis
Computer Science
Decision analysis
Diffie-Hellman Assumption
Encryption
Functions (mathematics)
Generic Hardness
Groth-Sahai proofs
Hash Proof Systems
Matemàtiques i estadística
Mathematical analysis
Networks
Nombres, Teoria dels
Number theory
Probability Theory and Stochastic Processes
Public-key Encryption
Teoria de nombres
Àlgebra
Àrees temàtiques de la UPC
Diffie–Hellman assumption
Public-key encryption
Groth–Sahai proofs
Hash proof systems
Generic hardness
ISSN:0933-2790, 1432-1378
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We put forward a new algebraic framework to generalize and analyze Diffie–Hellman like decisional assumptions which allows us to argue about security and applications by considering only algebraic properties. Our D ℓ , k - MDDH Assumption states that it is hard to decide whether a vector in G ℓ is linearly dependent of the columns of some matrix in G ℓ × k sampled according to distribution D ℓ , k . It covers known assumptions such as DDH , 2 - Lin (Linear Assumption) and k - Lin (the k -Linear Assumption). Using our algebraic viewpoint, we can relate the generic hardness of our assumptions in m -linear groups to the irreducibility of certain polynomials which describe the output of D ℓ , k . We use the hardness results to find new distributions for which the D ℓ , k - MDDH Assumption holds generically in m -linear groups. In particular, our new assumptions 2 - SCasc and 2 - ILin are generically hard in bilinear groups and, compared to 2 - Lin , have shorter description size, which is a relevant parameter for efficiency in many applications. These results support using our new assumptions as natural replacements for the 2 - Lin assumption which was already used in a large number of applications. To illustrate the conceptual advantages of our algebraic framework, we construct several fundamental primitives based on any MDDH Assumption. In particular, we can give many instantiations of a primitive in a compact way, including public-key encryption, hash proof systems, pseudo-random functions, and Groth–Sahai NIZK and NIWI proofs. As an independent contribution, we give more efficient NIZK and NIWI proofs for membership in a subgroup of G ℓ . The results imply very significant efficiency improvements for a large number of schemes.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0933-2790
1432-1378
DOI:10.1007/s00145-015-9220-6