Practical post-quantum few-time verifiable random function with applications to Algorand
From MaRDI portal
Publication:2147263
DOI10.1007/978-3-662-64331-0_29zbMath1491.94047OpenAlexW3210358905MaRDI QIDQ2147263
Amin Sakzad, Muhammed F. Esgin, Zhenfei Zhang, Shumo Chu, Shi-Feng Sun, Veronika Kuchta, Ron Steinfeld
Publication date: 22 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-662-64331-0_29
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (2)
Post-quantum verifiable random function from symmetric primitives in PoS blockchain ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- A generic approach to constructing and proving verifiable random functions
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- RingCT 3.0 for blockchain confidential transaction: shorter size and stronger security
- Worst-case to average-case reductions for module lattices
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Pseudorandom Functions and Lattices
- Constrained Verifiable Random Functions
- Constructing Verifiable Random Functions with Large Input Spaces
- Weak Verifiable Random Functions
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Efficient Construction of (Distributed) Verifiable Random Functions
- Verifiable Random Functions from Weaker Assumptions
- Public Key Cryptography - PKC 2005
- Verifiable random functions from non-interactive witness-indistinguishable proofs
This page was built for publication: Practical post-quantum few-time verifiable random function with applications to Algorand
