Sciweavers

352 search results - page 11 / 71
» Adaptively Secure Multi-Party Computation
Sort
View
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 1 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
IACR
2011
127views more  IACR 2011»
12 years 7 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
MIDDLEWARE
2004
Springer
14 years 1 months ago
Exploring adaptability of secure group communication using formal prototyping techniques
Traditionally, adaptability in communication frameworks has been restricted to predefined choices without taking into consideration tradeoffs between them and the application req...
Sebastian Gutierrez-Nolasco, Nalini Venkatasubrama...
COMCOM
2007
149views more  COMCOM 2007»
13 years 7 months ago
Adaptive security design with malicious node detection in cluster-based sensor networks
Distributed wireless sensor networks have problems on detecting and preventing malicious nodes, which always bring destructive threats and compromise multiple sensor nodes. Theref...
Meng-Yen Hsieh, Yueh-Min Huang, Han-Chieh Chao