Sciweavers

1173 search results - page 15 / 235
» On the Compositionality of Round Abstraction
Sort
View
ASIACRYPT
2004
Springer
14 years 3 months ago
Constant-Round Authenticated Group Key Exchange for Dynamic Groups
Abstract. An authenticated group key exchange (AGKE) scheme allows a group of users in a public network to share a session key which may later be used to achieve desirable cryptogr...
Hyun-Jeong Kim, Su-Mi Lee, Dong Hoon Lee
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 8 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 3 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
ASIACRYPT
2010
Springer
13 years 7 months ago
Improved Single-Key Attacks on 8-Round AES-192 and AES-256
Abstract. AES is the most widely used block cipher today, and its security is one of the most important issues in cryptanalysis. After 13 years of analysis, related-key attacks wer...
Orr Dunkelman, Nathan Keller, Adi Shamir