Robust Distributed Pseudorandom Functions for mNP Access Structures
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1808277 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 1304081 (Why is no real title available?)
- scientific article; zbMATH DE number 1942434 (Why is no real title available?)
- Constrained pseudorandom functions and their applications
- Cutting-edge cryptography through the lens of secret sharing
- Derandomization in Cryptography
- Distributed pseudorandom functions for general access structures in NP
- Function secret sharing
- Functional signatures and pseudorandom functions
- Hardness vs randomness
- How to use indistinguishability obfuscation
- Key homomorphic PRFs and their applications
- Leveled fully homomorphic signatures from standard lattices
- New techniques for noninteractive zero-knowledge
- Practical threshold signatures
- Robust and efficient sharing of RSA functions
- Secret-sharing for NP
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Threshold cryptosystems from threshold fully homomorphic encryption
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
This page was built for publication: Robust Distributed Pseudorandom Functions for mNP Access Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488966)
