Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
type: Item
instance of: scholarly article
title: Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
zbMATH Open document ID: 1479.94192
DOI: 10.1007/978-3-030-75245-3_22
author: Tibor Jager
author: Rafael Kurek
author: David Niehues
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7450194
zbMATH Keywords: blockwise partitioning
zbMATH Keywords: cryptographic hash function
MaRDI profile type: Publication
full work available at URL: 978-3-030-75245-3 22
OpenAlex ID: W3146095272
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
cites work: Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions
cites work: A Framework for Identity-Based Encryption with Almost Tight Security
cites work: Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
cites work: Generic constructions of identity-based and certificateless kEMs
cites work: On the Indifferentiability of the Sponge Construction
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Collisions of SHA-0 and Reduced SHA-1
cites work: Practical Signatures from Standard Assumptions
cites work: Confined guessing: new signatures from standard assumptions
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Q4783728
cites work: Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
cites work: Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
cites work: Q4542539
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
cites work: Shorter IBE and Signatures via Asymmetric Pairings
cites work: Improved Short Lattice Signatures in the Standard Model
cites work: Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
cites work: Signatures from sequential-OR proofs
cites work: Random Oracles with(out) Programmability
cites work: Programmable Hash Functions in the Multilinear Setting
cites work: Practical Identity-Based Encryption Without Random Oracles
cites work: Computational Complexity
cites work: On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
cites work: Verifiable Random Functions from Standard Assumptions
cites work: Short Signatures from Weaker Assumptions
cites work: Programmable Hash Functions and Their Applications
cites work: Constructing Verifiable Random Functions with Large Input Spaces
cites work: Verifiable Random Functions from Weaker Assumptions
cites work: Short digital signatures and ID-KEMs via truncation collision resistance
cites work: On the real-world instantiability of admissible hash functions and efficient verifiable random functions
cites work: On the untapped potential of encoding predicates by arithmetic circuits and their applications
cites work: Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
cites work: Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
cites work: Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
cites work: Q4718481
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Q4409113
cites work: A decade of lattice cryptography
cites work: Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions
cites work: Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
cites work: Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
cites work: Efficient Identity-Based Encryption Without Random Oracles
cites work: Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
cites work: Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
cites work: The Magic of ELFs
cites work: Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
description: scientific article; zbMATH DE number 7450194