Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
From MaRDI portal
Recommendations
Cites work
- Applied Cryptography and Network Security
- Cryptographically Sound Implementations for Communicating Processes
- Efficient concurrent zero-knowledge in the auxiliary string model
- Foundations of Cryptography
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 2081075 (Why is no real title available?)
- scientific article; zbMATH DE number 1759349 (Why is no real title available?)
- On the security of public key protocols
- Perfect Non-interactive Zero Knowledge for NP
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Security in Communication Networks
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Theory of Cryptography
- Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
Cited in
(3)
This page was built for publication: Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505478)