Verifiable random functions from non-interactive witness-indistinguishable proofs
From MaRDI portal
Publication:5915838
DOI10.1007/978-3-319-70503-3_19zbMath1412.94155OpenAlexW2593258036MaRDI QIDQ5915838
Publication date: 19 January 2018
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_19
Related Items (13)
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ From FE combiners to secure MPC and back ⋮ Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Communication complexity of Byzantine agreement, revisited ⋮ Streaming functional encryption ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ Ring-based identity based encryption -- asymptotically shorter MPK and tighter security ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Combiners for functional encryption, unconditionally ⋮ Amplifying the security of functional encryption, unconditionally
This page was built for publication: Verifiable random functions from non-interactive witness-indistinguishable proofs
