Sciweavers

948 search results - page 109 / 190
» Attacking cryptographic schemes based on
Sort
View
MOBIQUITOUS
2007
IEEE
14 years 2 months ago
Key Establishment Using Secure Distance Bounding Protocols
Key establishment is one of the major challenges in Wireless Personal Area Networks, as traditional security mechanisms often do not cope with the dynamic characteristics of wirel...
Dave Singelée, Bart Preneel
ASIACRYPT
2005
Springer
14 years 1 months ago
An Analysis of the XSL Algorithm
The XSL “algorithm” is a method for solving systems of multivariate polynomial equations based on the linearization method. It was proposed in 2002 as a dedicated method for ex...
Carlos Cid, Gaëtan Leurent
CONCUR
2005
Springer
14 years 1 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
FPL
2009
Springer
105views Hardware» more  FPL 2009»
14 years 21 days ago
Improving the quality of a Physical Unclonable Function using configurable Ring Oscillators
A silicon Physical Unclonable Function (PUF), which is a die-unique challenge-response function, is an emerging hardware primitive for secure applications. It exploits manufacturi...
Abhranil Maiti, Patrick Schaumont
STOC
1998
ACM
121views Algorithms» more  STOC 1998»
14 years 9 days ago
Non-Interactive and Non-Malleable Commitment
A commitment protocol is a fundamental cryptographic primitive used as a basic buildingblock throughoutmodern cryptography. In STOC 1991, Dolev Dwork and Naor showed that in many ...
Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovs...