Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
- 1 January 2015
- book chapter
- Published by Springer Nature
- p. 3-22
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Publicly Auditable Secure Multi-Party Computation2014
- Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing2014
- Multiparty Computation from Somewhat Homomorphic Encryption2012
- Secure Multiparty Computation Goes Live2009
- From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-SecurityIEEE Transactions on Information Theory, 2008
- Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption2003
- A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System2001
- Multiparty Computation from Threshold Homomorphic Encryption2001
- Random oracles are practical1993
- A robust and verifiable cryptographically secure election scheme1985