Sciweavers

34 search results - page 5 / 7
» A Practical Attack on a Braid Group Based Cryptographic Prot...
Sort
View
ICISC
2009
169views Cryptology» more  ICISC 2009»
13 years 4 months ago
Generic One Round Group Key Exchange in the Standard Model
Minimizing complexity of group key exchange (GKE) protocols is an important milestone towards their practical deployment. An interesting approach to achieve this goal is to simplif...
M. Choudary Gorantla, Colin Boyd, Juan Manuel Gonz...
CONCUR
2005
Springer
13 years 11 months ago
Constraint Solving for Contract-Signing Protocols
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
Detlef Kähler, Ralf Küsters
CCS
2008
ACM
13 years 8 months ago
Using rhythmic nonces for puzzle-based DoS resistance
To protect against replay attacks, many Internet protocols rely on nonces to guarantee freshness. In practice, the server generates these nonces during the initial handshake, but ...
Ellick Chan, Carl A. Gunter, Sonia Jahid, Evgeni P...
SACRYPT
2005
Springer
109views Cryptology» more  SACRYPT 2005»
13 years 11 months ago
Reducing Time Complexity in RFID Systems
Radio frequency identification systems based on low-cost computing devices is the new plaything that every company would like to adopt. Its goal can be either to improve the produ...
Gildas Avoine, Etienne Dysli, Philippe Oechslin
EUROCRYPT
1999
Springer
13 years 10 months ago
On the Performance of Hyperelliptic Cryptosystems
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
Nigel P. Smart