Post-quantum verifiable random function from symmetric primitives in PoS blockchain

DOI10.1007/978-3-031-17140-6_2MaRDI QIDQ6173282zbMATH OpenOpenAlexFDO

Authors Maxime Buser, Rafael Dowsley, Muhammed F. Esgin, Shabnam Kasra Kermanshahi, Veronika Kuchta, Joseph K. Liu, Raphael C.-W. Phan, Zhenfei Zhang

Publication date 21 July 2023

Published in Computer Security – ESORICS 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-17140-6_2

Mathematics Subject Classification ID

Computer security (68M25) Cryptography (94A60)

Recommendations

• Practical post-quantum few-time verifiable random function with applications to Algorand
• Post-quantum EPID signatures from symmetric primitives
• Computational quantum key distribution (CQKD) on decentralized ledger and blockchain
• An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems
• Efficient Construction of (Distributed) Verifiable Random Functions
• Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (lattice ringct v1.0)
• LegRoast: efficient post-quantum signatures from the Legendre PRF
• A novel quantum blockchain scheme base on quantum entanglement and DPoS
• Post-quantum adaptor signature for privacy-preserving off-chain payments

Cites work

• Ciphers for MPC and FHE
• scientific article; zbMATH DE number 708808 (Why is no real title available?)
• Introduction to post-quantum cryptography
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Practical post-quantum few-time verifiable random function with applications to Algorand
• Rainbow, a New Multivariable Polynomial Signature Scheme
• W-OTS+ – Shorter Signatures for Hash-Based Signature Schemes
• XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
• Zero-knowledge proofs from secure multiparty computation

Cited in

(11)

• PoSAT: proof-of-work availability and unpredictability, without the work
• Practical post-quantum few-time verifiable random function with applications to Algorand
• scientific article; zbMATH DE number 7774290 (Why is no real title available?)
• Enhanced post-quantum key escrow system for supervised data conflict of interest based on consortium blockchain
• The superlinearity problem in post-quantum blockchains
• Determining the number of confirmation blocks in a two-level blockchain with proof-of-proof consensus protocol for different consensus types in mainchain/sidechain to prevent double spend attack. I: PoS in mainchain and PoW in sidechain
• Verifiable random function from the Deuring correspondence and higher dimensional isogenies
• Key-homomorphic and aggregate verifiable random functions
• Breaking X-VRF, a post-quantum verifiable random function (short paper)
• Faster proofs and VRFs from isogenies
• Capybara and Tsubaki: verifiable random functions from group actions and isogenies

This page was built for publication: Post-quantum verifiable random function from symmetric primitives in PoS blockchain

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