Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems

DOI10.1007/978-3-662-54365-8_18zbMath1404.94117OpenAlexW2584243747MaRDI QIDQ5738797

Jorge Luis Villar

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/113265

zbMATH Keywords

black-box separationsdecisional linear assumptionblack-box reductionsMatrix Diffie-Hellman problems

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• An Algebraic Framework for Diffie-Hellman Assumptions
• Automated Analysis of Cryptographic Assumptions in Generic Group Models
• Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
• (Hierarchical) Identity-Based Encryption from Affine Message Authentication
• Tightly-Secure Signatures from Chameleon Hash Functions
• Disjunctions for Hash Proof Systems: New Constructions and Applications
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
• Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings
• Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Tightly-Secure Authenticated Key Exchange
• Cryptography and Coding