Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance (Q2061937)

scientific article; zbMATH DE number 7450194

Language	Label	Description	Also known as
English	Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance	scientific article; zbMATH DE number 7450194

Statements

instance of

scholarly article

0 references

title

Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance (English)

0 references

0 references

0 references

0 references

21 December 2021

0 references

zbMATH Keywords

blockwise partitioning

0 references

cryptographic hash function

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-75245-3_22

0 references

cites work

Efficient Lattice (H)IBE in the Standard Model

0 references

Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE

0 references

Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions

0 references

A Framework for Identity-Based Encryption with Almost Tight Security

0 references

Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme

0 references

Generic constructions of identity-based and certificateless kEMs

0 references

On the Indifferentiability of the Sponge Construction

0 references

Advances in Cryptology – CRYPTO 2004

0 references

Collisions of SHA-0 and Reduced SHA-1

0 references

Practical Signatures from Standard Assumptions

0 references

Confined guessing: new signatures from standard assumptions

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

Advances in Cryptology – CRYPTO 2004

0 references

Q4783728

0 references

Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More

0 references

Towards Tightly Secure Lattice Short Signature and Id-Based Encryption

0 references

Q4542539

0 references

Bonsai Trees, or How to Delegate a Lattice Basis

0 references

Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys

0 references

Shorter IBE and Signatures via Asymmetric Pairings

0 references

Improved Short Lattice Signatures in the Standard Model

0 references

Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures

0 references

Signatures from sequential-OR proofs

0 references

Random Oracles with(out) Programmability

0 references

Programmable Hash Functions in the Multilinear Setting

0 references

Practical Identity-Based Encryption Without Random Oracles

0 references

Computational Complexity

0 references

On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups

0 references

Verifiable Random Functions from Standard Assumptions

0 references

Short Signatures from Weaker Assumptions

0 references

Programmable Hash Functions and Their Applications

0 references

Constructing Verifiable Random Functions with Large Input Spaces

0 references

Verifiable Random Functions from Weaker Assumptions

0 references

Short digital signatures and ID-KEMs via truncation collision resistance

0 references

Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance

0 references

On the real-world instantiability of admissible hash functions and efficient verifiable random functions

0 references

On the untapped potential of encoding predicates by arithmetic circuits and their applications

0 references

Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps

0 references

Hunting and gathering -- verifiable random functions from standard assumptions with short proofs

0 references

Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting

0 references

Q4718481

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Q4409113

0 references

A decade of lattice cryptography

0 references

Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions

0 references

Adaptive-Secure VRFs with Shorter Keys from Static Assumptions

0 references

Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions

0 references

Efficient Identity-Based Encryption Without Random Oracles

0 references

Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters

0 references

Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques

0 references

The Magic of ELFs

0 references

Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes

0 references

Identifiers

zbMATH Open document ID

1479.94192

0 references

DOI

10.1007/978-3-030-75245-3_22

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2061937