Sciweavers

27 search results - page 5 / 6
» stoc 1996
Sort
View
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
13 years 9 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
CC
2007
Springer
123views System Software» more  CC 2007»
13 years 5 months ago
An Improved Analysis of Linear Mergers
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
Zeev Dvir, Amir Shpilka
JACM
2007
132views more  JACM 2007»
13 years 5 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
STOC
2010
ACM
199views Algorithms» more  STOC 2010»
13 years 10 months ago
Zero-One Frequency Laws
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...
Vladimir Braverman and Rafail Ostrovsky
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 5 months ago
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
Yehuda Lindell, Hila Zarosim