Preprocessing Based Verification of Multiparty Protocols with Honest Majority
This paper presents a generic “GMW-style” method for turning passively secure protocols into protocols secure against covert attacks, adding relatively cheap offline preprocessing and post-execution verification phases. Our construction performs best with a small number of parties, and its main bene...
Main Authors: | Laud Peeter, Pankova Alisa, Jagomägis Roman |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2017-10-01
|
Series: | Proceedings on Privacy Enhancing Technologies |
Subjects: | |
Online Access: | https://doi.org/10.1515/popets-2017-0038 |
Similar Items
-
Privacy-preserving record linkage in large databases using secure multiparty computation
by: Peeter Laud, et al.
Published: (2018-10-01) -
Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees
by: Laud Peeter
Published: (2015-06-01) -
Multiparty Homomorphic Encryption from Ring-Learning-with-Errors
by: Mouchet Christian, et al.
Published: (2021-10-01) -
Multiparty Delegated Quantum Computing
by: Elham Kashefi, et al.
Published: (2017-07-01) -
A General Framework for Multiparty Computations
by: Reistad, Tord Ingolf
Published: (2012)