Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ASIACRYPT
2000
Springer
11 years 11 months ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
ASIACRYPT
2000
Springer
11 years 11 months ago
Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis
In this paper we introduce a structure iterated by the rule A of Skipjack and show that this structure is provably resistant against differential or linear attacks. It is the main ...
Jaechul Sung, Sangjin Lee, Jong In Lim, Seokhie Ho...
ASIACRYPT
2000
Springer
11 years 11 months ago
Efficient Secure Multi-party Computation
Martin Hirt, Ueli M. Maurer, Bartosz Przydatek
ASIACRYPT
2000
Springer
11 years 11 months ago
Attacking and Repairing Batch Verification Schemes
Colin Boyd, Chris Pavlovski
ASIACRYPT
2000
Springer
11 years 11 months ago
The Security of Chaffing and Winnowing
This paper takes a closer look at Rivest's chaffing-and-winnowing paradigm for data privacy. We begin with a definition which enables one to clearly determine whether a given ...
Mihir Bellare, Alexandra Boldyreva
ASIACRYPT
2000
Springer
11 years 11 months ago
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
In 1980 Hellman introduced a general technique for breaking arbitrary block ciphers with N possible keys in time T and memory M related by the tradeoff curve TM2 = N2 for 1 T N. ...
Alex Biryukov, Adi Shamir
ASIACRYPT
2000
Springer
12 years 16 days ago
Towards Signature-Only Signature Schemes
We consider a problem which was stated in a request for comments made by NIST in the FIPS97 document. The question is the following: Can we have a digital signature public key infr...
Adam Young, Moti Yung
ASIACRYPT
2000
Springer
12 years 16 days ago
Proofs of Security for the Unix Password Hashing Algorithm
We give the first proof of security for the full Unix password hashing algorithm (rather than of a simplified variant). Our results show that it is very good at extracting almost...
David Wagner, Ian Goldberg
ASIACRYPT
2000
Springer
12 years 16 days ago
Cryptanalysis of the Yi-Lam Hash
David Wagner
books