Verifiable random functions with optimal tightness (Q2061948)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Verifiable random functions with optimal tightness	scientific article

Statements

scholarly article

0 references

Verifiable random functions with optimal tightness (English)

0 references

0 references

publication date

21 December 2021

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-75248-4_3

0 references

Verifiable random functions: relations to identity-based key encapsulation and new constructions

0 references

Tightly-Secure Signatures from Lossy Identification Schemes

0 references

Separating Short Structure-Preserving Signatures from Non-interactive Assumptions

0 references

On the Impossibility of Tight Cryptographic Reductions

0 references

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

0 references

Verifiable random functions from non-interactive witness-indistinguishable proofs

0 references

Tightly-Secure Signatures from Chameleon Hash Functions

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

Advances in Cryptology – CRYPTO 2004

0 references

Towards Tightly Secure Lattice Short Signature and Id-Based Encryption

0 references

Fully, (Almost) Tightly Secure IBE and Dual System Groups

0 references

Discrete logarithm problems with auxiliary inputs

0 references

0 references

New Generation of Secure and Practical RSA-Based Signatures

0 references

Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain

0 references

Adaptively secure constrained pseudorandom functions in the standard model

0 references

Optimal security reductions for unique signatures: bypassing impossibilities with a counterexample

0 references

Tightly Secure Signatures and Public-Key Encryption

0 references

Verifiable Random Functions from Standard Assumptions

0 references

Waters Signatures with Optimal Security Reduction

0 references

Constructing Verifiable Random Functions with Large Input Spaces

0 references

0 references

Verifiable Random Functions from Weaker Assumptions

0 references

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

0 references

Simple and more efficient PRFs with tight security from LWE and matrix-DDH

0 references

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

0 references

Optimal Security Proofs for Full Domain Hash, Revisited

0 references

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

0 references

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

0 references

Why Proving HIBE Systems Secure Is Difficult

0 references

On the security loss of unique signatures

0 references

On the adaptive security of MACs and PRFs

0 references

Number-theoretic constructions of efficient pseudo-random functions

0 references

Verifiable random functions with optimal tightness

0 references

Adaptive-Secure VRFs with Shorter Keys from Static Assumptions

0 references

Tight Proofs for Signature Schemes without Random Oracles

0 references

Efficient Identity-Based Encryption Without Random Oracles

0 references

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

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-75248-4_3

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2061948

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2061948&oldid=36752474"