Sciweavers

165 search results - page 13 / 33
» Cryptographic Complexity Classes and Computational Intractab...
Sort
View
ICDCS
2010
IEEE
14 years 12 months ago
Complexity Analysis of Weak Multitolerance
—In this paper, we classify multitolerant systems, i.e., systems that tolerate multiple classes of faults and provide potentially different levels of tolerance to them in terms o...
Jingshu Chen, Sandeep Kulkarni
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
15 years 5 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
95
Voted
SIGMETRICS
2010
ACM
203views Hardware» more  SIGMETRICS 2010»
14 years 12 months ago
An analytical framework to infer multihop path reliability in MANETs
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
Nelson Antunes, Gonçalo Jacinto, Antó...
85
Voted
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
15 years 12 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
CRYPTO
2009
Springer
105views Cryptology» more  CRYPTO 2009»
15 years 6 months ago
Privacy-Enhancing Auctions Using Rational Cryptography
Abstract. We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, ou...
Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Tr...