Sciweavers

ASIACRYPT
2007
Springer
13 years 11 months ago
How to Build a Hash Function from Any Collision-Resistant Function
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...
Thomas Ristenpart, Thomas Shrimpton
ASIACRYPT
2007
Springer
13 years 11 months ago
Secure Protocols with Asymmetric Trust
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
Ivan Damgård, Yvo Desmedt, Matthias Fitzi, J...
ASIACRYPT
2007
Springer
13 years 11 months ago
On Privacy Models for RFID
Serge Vaudenay
ASIACRYPT
2007
Springer
13 years 11 months ago
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
Ueli M. Maurer, Dominik Raub
ASIACRYPT
2007
Springer
13 years 11 months ago
Fully Anonymous Group Signatures Without Random Oracles
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...
Jens Groth
ASIACRYPT
2007
Springer
13 years 11 months ago
When e-th Roots Become Easier Than Factoring
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
Antoine Joux, David Naccache, Emmanuel Thomé...
ASIACRYPT
2007
Springer
13 years 11 months ago
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...
Jacques Patarin, Valérie Nachef, Côme...
ASIACRYPT
2007
Springer
13 years 11 months ago
Faster Addition and Doubling on Elliptic Curves
Edwards recently introduced a new normal form for elliptic curves. Every elliptic curve over a non-binary field is birationally equivalent to a curve in Edwards form over an exten...
Daniel J. Bernstein, Tanja Lange
ASIACRYPT
2007
Springer
13 years 11 months ago
Seven-Property-Preserving Iterated Hashing: ROX
Elena Andreeva, Gregory Neven, Bart Preneel, Thoma...
ASIACRYPT
2007
Springer
13 years 11 months ago
Group Encryption
Aggelos Kiayias, Yiannis Tsiounis, Moti Yung