An algebraic framework for Diffie-Hellman assumptions
From MaRDI portal
Publication:514473
DOI10.1007/s00145-015-9220-6zbMath1370.94510OpenAlexW1826672334MaRDI QIDQ514473
Eike Kiltz, Carla Ràfols, Gottfried Herold, Alex Escala, Jorge Luis Villar
Publication date: 2 March 2017
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-015-9220-6
Related Items
Fast, Compact, and Expressive Attribute-Based Encryption ⋮ QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ Quantum algorithms for the \(k\)-XOR problem ⋮ Multi-input quadratic functional encryption from pairings ⋮ Authenticated key exchange and signatures with tight security in the standard model ⋮ Signatures of knowledge for Boolean circuits under standard assumptions ⋮ CCA-secure ABE using tag and pair encoding ⋮ Decentralized policy-hiding ABE with receiver privacy ⋮ Efficient chameleon hash functions in the enhanced collision resistant model ⋮ (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin ⋮ Fully adaptive decentralized multi-authority \textsf{ABE} ⋮ Unbounded quadratic functional encryption and more from pairings ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ On the security of functional encryption in the generic group model ⋮ Unbounded predicate inner product functional encryption from pairings ⋮ The Kernel Matrix Diffie-Hellman Assumption ⋮ A survey on functional encryption ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ Unbounded dynamic predicate compositions in ABE from standard assumptions ⋮ Simple and more efficient PRFs with tight security from LWE and matrix-DDH ⋮ Efficient identity-based encryption with hierarchical key-insulation from HIBE ⋮ Tightly secure inner product functional encryption: multi-input and function-hiding constructions ⋮ Fast, compact, and expressive attribute-based encryption ⋮ Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions ⋮ Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption ⋮ Tag-based ABE in prime-order groups via pair encoding ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Fully secure ABE with outsourced decryption against chosen ciphertext attack ⋮ Short tightly secure signatures for signing a vector of group elements: a new approach ⋮ Unnamed Item ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A one round protocol for tripartite Diffie-Hellman
- An Algebraic Framework for Diffie-Hellman Assumptions
- Identity-Based Encryption with Master Key-Dependent Message Security and Leakage-Resilience
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
- Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions
- Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions
- Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
- Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption
- Tightly Secure Signatures and Public-Key Encryption
- Quasi-Adaptive NIZK for Linear Subspaces Revisited
- Round-Optimal Password-Based Authenticated Key Exchange
- Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Circular-Secure Encryption from Decision Diffie-Hellman
- The Uber-Assumption Family
- Secure Hybrid Encryption from Weakened Key Encapsulation
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- A New Randomness Extraction Paradigm for Hybrid Encryption
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Efficient Noninteractive Proof Systems for Bilinear Groups
- On the (Im)possibility of Projecting Property in Prime-Order Setting
- Optimal Reductions of Some Decisional Problems to the Rank Problem
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Advances in Cryptology – CRYPTO 2004
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
- Public-Key Cryptosystems Resilient to Key Leakage
- Theory of Cryptography
