Constrained verifiable random functions from indistinguishability obfuscation

DOI10.1007/978-3-319-26059-4_3MaRDI QIDQ3467155zbMATH OpenOpenAlexFDO

Authors Bei Liang, Hongda Li, Jinyong Chang

Publication date 27 January 2016

Published in Provable Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-26059-4_3

zbMATH Keywords

commitment schemesconstrained VRFsindistinguishability obfuscationpuncturable PRFs

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Constrained verifiable random functions
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• Verifiable random functions from non-interactive witness-indistinguishable proofs
• A generic approach to constructing and proving verifiable random functions
• Weak Verifiable Random Functions

Cited in

(3)

• Constrained verifiable random functions
• Constrained (Verifiable) Pseudorandom Function from Functional Encryption
• Constrained verifiable random functions without obfuscation and friends

This page was built for publication: Constrained verifiable random functions from indistinguishability obfuscation

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