Sciweavers

100 search results - page 7 / 20
» Asynchronous Secure Multiparty Computation in Constant Time
Sort
View
FC
2010
Springer
196views Cryptology» more  FC 2010»
13 years 9 months ago
Secure Computation with Fixed-Point Numbers
Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computatio...
Octavian Catrina, Amitabh Saxena
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 9 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
ICDM
2006
IEEE
131views Data Mining» more  ICDM 2006»
14 years 2 months ago
Transforming Semi-Honest Protocols to Ensure Accountability
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. This is especially important in the field of privacy...
Wei Jiang, Chris Clifton
PODC
2009
ACM
14 years 9 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
13 years 10 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola