Secure Computation, I/O-Efficient Algorithms and Distributed Signatures
From MaRDI portal
Publication:2890013
DOI10.1007/978-3-642-27954-6_18zbMath1292.94052OpenAlexW65695529MaRDI QIDQ2890013
Tomas Toft, Jonas Kölker, Ivan B. Damgård
Publication date: 8 June 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27954-6_18
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient signature generation by smart cards
- Secure multi-party computation without agreement
- Secure Computation, I/O-Efficient Algorithms and Distributed Signatures
- Security of Ramp Schemes
- How to share a secret
- Optimally efficient multi-valued byzantine agreement
- Atomic Secure Multi-party Multiplication with Low Communication
- Perfectly-Secure MPC with Linear Communication Complexity
- Theory of Cryptography
This page was built for publication: Secure Computation, I/O-Efficient Algorithms and Distributed Signatures