Sciweavers

225 search results - page 45 / 45
» Nonperfect Secret Sharing Schemes
Sort
View
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
13 years 11 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
SP
2006
IEEE
109views Security Privacy» more  SP 2006»
13 years 10 months ago
Integrity (I) Codes: Message Integrity Protection and Authentication Over Insecure Channels
Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit errors are possible (e.g., it is possible to change a bit “0” into a bi...
Mario Cagalj, Jean-Pierre Hubaux, Srdjan Capkun, R...
ICICS
2003
Springer
13 years 10 months ago
ID-Based Distributed "Magic Ink" Signature from Pairings
The advantage of ID-based system is the simplification of key distribution and certification management; a user can directly use his identity as his public key instead of an arbi...
Yan Xie, Fangguo Zhang, Xiaofeng Chen, Kwangjo Kim
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 6 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
USS
2010
13 years 2 months ago
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
Yitao Duan, NetEase Youdao, John Canny, Justin Z. ...