STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Information and Computation
Bit optimal distributed consensus
Computer science
Communications of the ACM
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Efficient Multiparty Protocols Using Circuit Randomization
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Robust multiparty computation with linear communication complexity
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Scalable Multiparty Computation with Nearly Optimal Work and Resilience
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Round Efficient Unconditionally Secure Multiparty Computation Protocol
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Perfectly reliable and secure message transmission tolerating mobile adversary
International Journal of Applied Cryptography
Asynchronous Multiparty Computation: Theory and Implementation
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Efficient statistical asynchronous verifiable secret sharing with optimal resilience
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
P4P: practical large-scale privacy-preserving distributed computation robust against malicious users
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
International Journal of Applied Cryptography
Communication efficient statistical asynchronous multiparty computation with optimal resilience
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
Error-free multi-valued consensus with byzantine failures
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Secure message transmission in asynchronous networks
Journal of Parallel and Distributed Computing
Communication optimal multi-valued asynchronous byzantine agreement with optimal resilience
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Perfectly-secure multiplication for any t n/3
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
From passive to covert security at low cost
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Perfectly secure multiparty computation and the computational overhead of cryptography
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Efficient (n, t, n) secret sharing schemes
Journal of Systems and Software
Secure computation, i/o-efficient algorithms and distributed signatures
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Byzantine broadcast in point-to-point networks using local linear coding
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Zero-Knowledge proofs with low amortized communication from lattice assumptions
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Active security in multiparty computation over black-box groups
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Secure outsourced computation of iris matching
Journal of Computer Security
| Hi-index | 0.00 |
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function, even when up to t players are under the control of an adversary. Known perfectly secure MPC protocols require communication of at least Ω(n3) field elements per multiplication, whereas cryptographic or unconditional security is possible with communication linear in the number of players. We present a perfectly secure MPC protocol communicating O(n) field elements per multiplication. Our protocol provides perfect security against an active, adaptive adversary corrupting t n/3 players, which is optimal. Thus our protocol improves the security of the most efficient information-theoretically secure protocol at no extra costs, respectively improves the efficiency of perfectly secure MPC protocols by a factor of Ω(n2). To achieve this, we introduce a novel technique - constructing detectable protocols with the help of so-called hyper-invertible matrices, which we believe to be of independent interest. Hyper-invertible matrices allow (among other things) to perform efficient correctness checks of many instances in parallel, which was until now possible only if error-probability was allowed.