Verifiable random functions with optimal tightness
type: Item
instance of: scholarly article
title: Verifiable random functions with optimal tightness
zbMATH Open document ID: 1479.94236
DOI: 10.1007/978-3-030-75248-4_3
author: David Niehues
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7450201
MaRDI profile type: Publication
full work available at URL: 978-3-030-75248-4 3
OpenAlex ID: W3164591282
cites work: Verifiable random functions: relations to identity-based key encapsulation and new constructions
cites work: Tightly-Secure Signatures from Lossy Identification Schemes
cites work: Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
cites work: On the Impossibility of Tight Cryptographic Reductions
cites work: Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
cites work: Verifiable random functions from non-interactive witness-indistinguishable proofs
cites work: Tightly-Secure Signatures from Chameleon Hash Functions
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Towards Tightly Secure Lattice Short Signature and Id-Based Encryption
cites work: Fully, (Almost) Tightly Secure IBE and Dual System Groups
cites work: Discrete logarithm problems with auxiliary inputs
cites work: Q4737250
cites work: New Generation of Secure and Practical RSA-Based Signatures
cites work: Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
cites work: Adaptively secure constrained pseudorandom functions in the standard model
cites work: Optimal security reductions for unique signatures: bypassing impossibilities with a counterexample
cites work: Tightly Secure Signatures and Public-Key Encryption
cites work: Verifiable Random Functions from Standard Assumptions
cites work: Waters Signatures with Optimal Security Reduction
cites work: Constructing Verifiable Random Functions with Large Input Spaces
cites work: Q3549728
cites work: Verifiable Random Functions from Weaker Assumptions
cites work: Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
cites work: Simple and more efficient PRFs with tight security from LWE and matrix-DDH
cites work: On the real-world instantiability of admissible hash functions and efficient verifiable random functions
cites work: Optimal Security Proofs for Full Domain Hash, Revisited
cites work: On the untapped potential of encoding predicates by arithmetic circuits and their applications
cites work: Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
cites work: Why Proving HIBE Systems Secure Is Difficult
cites work: On the security loss of unique signatures
cites work: On the adaptive security of MACs and PRFs
cites work: Number-theoretic constructions of efficient pseudo-random functions
cites work: Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
cites work: Tight Proofs for Signature Schemes without Random Oracles
cites work: Efficient Identity-Based Encryption Without Random Oracles
cites work: Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
description: scientific article; zbMATH DE number 7450201