Sciweavers

172 search results - page 16 / 35
» Black-Box Constructions of Protocols for Secure Computation
Sort
View
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
14 years 1 months ago
Constant Round Authenticated Group Key Agreement via Distributed Computation
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
Emmanuel Bresson, Dario Catalano
ESORICS
2009
Springer
14 years 8 months ago
Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing
Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and databases to the centralized large data centers, whe...
Qian Wang, Cong Wang, Jin Li, Kui Ren, Wenjing Lou
ASIACRYPT
2004
Springer
14 years 1 months ago
Strong Conditional Oblivious Transfer and Computing on Intervals
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
Ian F. Blake, Vladimir Kolesnikov
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 8 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
FSTTCS
2009
Springer
14 years 2 months ago
Simulation based security in the applied pi calculus
We present a symbolic framework for refinement and composition of security protocols. ework uses the notion of ideal functionalities. These are abstract systems which are secure b...
Stéphanie Delaune, Steve Kremer, Olivier Pe...