Key-homomorphic and aggregate verifiable random functions

DOI10.1007/978-3-031-78023-3_4MaRDI QIDQ6955271zbMATH OpenFDO

Authors Giulio Malavolta

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-78023-3_4

zbMATH Keywords

lattice-based aggregate VRFpairing-based aggregate VRF

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

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?)
• A generic approach to constructing and proving verifiable random functions
• Advances in Cryptology - EUROCRYPT 2004
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Boosting batch arguments and RAM delegation
• Compact E-Cash and Simulatable VRFs Revisited
• Compact multi-signatures for smaller blockchains
• Compressible FHE with applications to PIR
• Constructing verifiable random functions with large input spaces
• Correlation intractability and SNARGs from sub-exponential DDH
• Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
• Extracting randomness from extractor-dependent sources
• How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
• Hunting and gathering -- verifiable random functions from standard assumptions with short proofs
• Key homomorphic PRFs and their applications
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Lockable obfuscation
• Non-interactive batch arguments for NP from standard assumptions
• Obfuscating compute-and-compare programs under LWE
• On the communication complexity of secure function evaluation with long output
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Post-quantum verifiable random function from symmetric primitives in PoS blockchain
• Practical Compact E-Cash
• Practical post-quantum few-time verifiable random function with applications to Algorand
• Public Key Cryptography - PKC 2005
• SNARGs for \(\mathcal{P}\) from LWE
• SNARGs for monotone policy batch NP
• Short signatures from the Weil pairing
• The algebraic group model and its applications
• Updatable Zero-Knowledge Databases
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable random functions from standard assumptions
• Verifiable random functions from weaker assumptions

Cited in

(1)

• Simplified adaptively secure threshold BLS signatures

This page was built for publication: Key-homomorphic and aggregate verifiable random functions

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