Sciweavers

44 search results - page 4 / 9
» eurocrypt 2008
Sort
View
EUROCRYPT
2008
Springer
14 years 11 months ago
Security/Efficiency Tradeoffs for Permutation-Based Hashing
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security. For coll...
Phillip Rogaway, John P. Steinberger
EUROCRYPT
2008
Springer
14 years 11 months ago
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...
Jens Groth, Yuval Ishai
EUROCRYPT
2008
Springer
14 years 11 months ago
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
Kaoru Kurosawa, Kazuhiro Suzuki
EUROCRYPT
2008
Springer
14 years 11 months ago
Threshold RSA for Dynamic and Ad-Hoc Groups
Abstract--We consider the use of threshold signatures in adhoc and dynamic groups such as MANETs ("mobile ad-hoc networks"). We first show that known threshold RSA signat...
Rosario Gennaro, Shai Halevi, Hugo Krawczyk, Tal R...
80
Voted
EUROCRYPT
2010
Springer
15 years 1 months ago
Stam's Collision Resistance Conjecture
At CRYPTO 2008 Stam [7] made the following conjecture: if an m + s-bit to s-bit compression function F makes r calls to a primitive f of n-bit input, then a collision for F can be ...
John P. Steinberger