Four Round Secure Computation Without Setup
Authors:
- Zvika BrakerskiZBZvika Brakerski
- Shai HaleviSHShai Halevi
- Antigoni PolychroniadouAPAntigoni Polychroniadou
- 5 November 2017
- book chapter
- Published by Springer Nature
- p. 645-677
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts2016
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds2016
- The Exact Round Complexity of Secure Computation2016
- Multi-identity and Multi-key Leveled FHE from Learning with Errors2015
- Two-Round Secure MPC from Indistinguishability Obfuscation2014
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE2012
- Public-Key Encryption Schemes with Auxiliary Inputs2010
- Foundations of Cryptography2004
- Multiple NonInteractive Zero Knowledge Proofs Under General AssumptionsSIAM Journal on Computing, 1999
- Witness indistinguishable and witness hiding protocols1990