Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
From MaRDI portal
Publication:2061937
DOI10.1007/978-3-030-75245-3_22zbMath1479.94192OpenAlexW3146095272MaRDI QIDQ2061937
Rafael Kurek, Tibor Jager, David Niehues
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_22
Related Items (4)
More efficient adaptively secure lattice-based IBE with equality test in the standard model ⋮ Lattice-based programmable hash functions and applications ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Verifiable random functions with optimal tightness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the real-world instantiability of admissible hash functions and efficient verifiable random functions
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- On the untapped potential of encoding predicates by arithmetic circuits and their applications
- Short digital signatures and ID-KEMs via truncation collision resistance
- Confined guessing: new signatures from standard assumptions
- Signatures from sequential-OR proofs
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
- Generic constructions of identity-based and certificateless kEMs
- Verifiable Random Functions from Standard Assumptions
- A Decade of Lattice Cryptography
- A Framework for Identity-Based Encryption with Almost Tight Security
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- The Magic of ELFs
- Programmable Hash Functions in the Multilinear Setting
- Improved Short Lattice Signatures in the Standard Model
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
- Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions
- Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions
- Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Random Oracles with(out) Programmability
- Short Signatures from Weaker Assumptions
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Constructing Verifiable Random Functions with Large Input Spaces
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Practical Identity-Based Encryption Without Random Oracles
- Programmable Hash Functions and Their Applications
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Shorter IBE and Signatures via Asymmetric Pairings
- Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
- Practical Signatures from Standard Assumptions
- Verifiable Random Functions from Weaker Assumptions
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Collisions of SHA-0 and Reduced SHA-1
- Efficient Identity-Based Encryption Without Random Oracles
- On the Indifferentiability of the Sponge Construction
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
- Computational Complexity
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
This page was built for publication: Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
