Practical Post-quantum Few-Time Verifiable Random Function with Applications to Algorand
- 23 October 2021
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Pseudorandom Functions and LatticesLecture Notes in Computer Science, 2012
- Constructing Verifiable Random Functions with Large Input SpacesLecture Notes in Computer Science, 2010
- Weak Verifiable Random FunctionsPublished by Springer Science and Business Media LLC ,2009
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based SignaturesLecture Notes in Computer Science, 2009
- Simulatable VRFs with Applications to Multi-theorem NIZKPublished by Springer Science and Business Media LLC ,2007
- A Verifiable Random Function with Short Proofs and KeysLecture Notes in Computer Science, 2005
- Aggregate and Verifiably Encrypted Signatures from Bilinear MapsLecture Notes in Computer Science, 2003
- Efficient Construction of (Distributed) Verifiable Random FunctionsLecture Notes in Computer Science, 2002
- Unique Signatures and Verifiable Random Functions from the DH-DDH SeparationLecture Notes in Computer Science, 2002
- Short Signatures from the Weil PairingLecture Notes in Computer Science, 2001