Sciweavers

80 search results - page 2 / 16
» Zero-knowledge from secure multiparty computation
Sort
View
GRC
2008
IEEE
13 years 6 months ago
Scalar-product based Secure Two-party Computation
—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith p...
Chih-Hao Shen, Justin Zhan, Tsan-sheng Hsu, Churn-...
CRYPTO
2012
Springer
262views Cryptology» more  CRYPTO 2012»
11 years 8 months ago
Functional Encryption with Bounded Collusions via Multi-party Computation
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
ASIACRYPT
2005
Springer
13 years 11 months ago
Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...
Zhifang Zhang, Mulan Liu, Liangliang Xiao
ASIACRYPT
2007
Springer
13 years 11 months ago
Multi-party Indirect Indexing and Applications
Abstract. We develop a new multi-party generalization of Naor-Nissim indirect indexing, making it possible for many participants to simulate a RAM machine with only poly-logarithmi...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
EUROCRYPT
2008
Springer
13 years 7 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Vipul Goyal, Payman Mohassel, Adam Smith