A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Communication complexity of secure computation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A note on efficient zero-knowledge proofs and arguments (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Communication preserving protocols for secure function evaluation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Probabilistic encryption & how to play mental poker keeping secret all partial information
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Black-box constructions for secure computation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Revisiting the Efficiency of Malicious Two-Party Computation
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Secure Computation from Random Error Correcting Codes
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Founding Cryptography on Oblivious Transfer --- Efficiently
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Error correction up to the information-theoretic limit
Communications of the ACM - Being Human in the Digital Age
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
Efficient Robust Private Set Intersection
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Security against covert adversaries: efficient protocols for realistic adversaries
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Secure linear algebra using linearly recurrent sequences
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Efficient two party and multi party computation against covert adversaries
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Efficiency tradeoffs for malicious two-party computation
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Communication efficient secure linear algebra
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Non-black-box computation of linear regression protocols with malicious adversaries
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Secure efficient multiparty computing of multivariate polynomials and applications
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Fast computation on encrypted polynomials and applications
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
| Hi-index | 0.00 |
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may corrupt all but one of the parties. Our protocols are round and communication efficient, and use the underlying cryptographic primitives in a black-box way. Our construction achieves optimal communication complexity for degree 2 and 3 polynomials. Our constructions can be used to securely and efficiently realize a wide range of functionalities. For instance, we demonstrate how our techniques lead to efficient protocols for secure linear algebra with security against malicious adversaries. Other applications include secure evaluation of DNF/CNF formulas, and conditional secret reconstruction (or conditional oblivious transfer) for a large family of condition functions.