Two Round Multiparty Computation via Multi-key FHE
Top Cited Papers
- 28 April 2016
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Multi-identity and Multi-key Leveled FHE from Learning with ErrorsPublished by Springer Science and Business Media LLC ,2015
- Faster Bootstrapping with Polynomial ErrorLecture Notes in Computer Science, 2014
- (Leveled) fully homomorphic encryption without bootstrappingPublished by Association for Computing Machinery (ACM) ,2012
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHELecture Notes in Computer Science, 2012
- Efficient Fully Homomorphic Encryption from (Standard) LWEPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Semi-homomorphic Encryption and Multiparty ComputationLecture Notes in Computer Science, 2011
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based CryptosystemsLecture Notes in Computer Science, 2010
- Universally Composable Efficient Multiparty Computation from Threshold Homomorphic EncryptionLecture Notes in Computer Science, 2003
- Multiparty Computation from Threshold Homomorphic EncryptionLecture Notes in Computer Science, 2001
- The round complexity of secure protocolsPublished by Association for Computing Machinery (ACM) ,1990