Practical post-quantum few-time verifiable random function with applications to Algorand

DOI10.1007/978-3-662-64331-0_29MaRDI QIDQ2147263zbMATH OpenOpenAlexFDO

Authors Muhammed F. Esgin, Veronika Kuchta, Amin Sakzad, Ron Steinfeld, Zhenfei Zhang, Shi-Feng Sun, Shumo Chu

Publication date 22 June 2022

Full work available at URL https://doi.org/10.1007/978-3-662-64331-0_29

zbMATH Keywords

latticepost-quantumblockchainAlgorandverifiable random function

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Post-quantum verifiable random function from symmetric primitives in PoS blockchain
• Simulatable verifiable random function from the LWE assumption
• The price of verifiability: lower bounds for verifiable random functions
• Verifiable random functions with optimal tightness
• Public Key Cryptography - PKC 2005

Cites work

• scientific article; zbMATH DE number 1942446 (Why is no real title available?)
• scientific article; zbMATH DE number 2009971 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• A generic approach to constructing and proving verifiable random functions
• Constrained verifiable random functions
• Constructing verifiable random functions with large input spaces
• Efficient Construction of (Distributed) Verifiable Random Functions
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Pseudorandom functions and lattices
• Public Key Cryptography - PKC 2005
• RingCT 3.0 for blockchain confidential transaction: shorter size and stronger security
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• Simulatable VRFs with Applications to Multi-theorem NIZK
• Verifiable Random Functions from Identity-Based Key Encapsulation
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable random functions from weaker assumptions
• Weak Verifiable Random Functions
• Worst-case to average-case reductions for module lattices
• Zero-knowledge arguments for lattice-based PRFs and applications to E-cash

Cited in

(4)

• Post-quantum verifiable random function from symmetric primitives in PoS blockchain
• Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
• Unbiasable verifiable random functions
• Practical verifiable random function with RKA security

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Practical post-quantum few-time verifiable random function with applications to Algorand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147263)