Breaking X-VRF, a post-quantum verifiable random function (short paper)
From MaRDI portal
Cites work
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- Fast Software Encryption
- scientific article; zbMATH DE number 3877077 (Why is no real title available?)
- scientific article; zbMATH DE number 1942446 (Why is no real title available?)
- scientific article; zbMATH DE number 1842510 (Why is no real title available?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Post-quantum verifiable random function from symmetric primitives in PoS blockchain
- Practical post-quantum few-time verifiable random function with applications to Algorand
- Public Key Cryptography - PKC 2005
- Updatable Zero-Knowledge Databases
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
This page was built for publication: Breaking X-VRF, a post-quantum verifiable random function (short paper)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979739)