Round Efficient Unconditionally Secure Multiparty Computation Protocol
From MaRDI portal
Publication:5504622
DOI10.1007/978-3-540-89754-5_15zbMath1203.94118OpenAlexW2150023103MaRDI QIDQ5504622
Ashish Choudhury, Arpita Patra, C. Pandu Rangan
Publication date: 22 January 2009
Published in: Progress in Cryptology - INDOCRYPT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89754-5_15
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- Universal classes of hash functions
- Scalable and Unconditionally Secure Multiparty Computation
- Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience
- Optimally efficient multi-valued byzantine agreement
- Perfectly-Secure MPC with Linear Communication Complexity
- Theory of Cryptography
This page was built for publication: Round Efficient Unconditionally Secure Multiparty Computation Protocol