Sciweavers

91 search results - page 8 / 19
» Bounded Key-Dependent Message Security
Sort
View
CTRSA
2007
Springer
171views Cryptology» more  CTRSA 2007»
13 years 11 months ago
Compact E-Cash from Bounded Accumulator
Abstract. Known compact e-cash schemes are constructed from signature schemes with efficient protocols and verifiable random functions. In this paper, we introduce a different ap...
Man Ho Au, Qianhong Wu, Willy Susilo, Yi Mu
ICISC
2008
123views Cryptology» more  ICISC 2008»
13 years 11 months ago
The Swiss-Knife RFID Distance Bounding Protocol
Relay attacks are one of the most challenging threats RFID will have to face in the close future. They consist in making the verifier believe that the prover is in its close vicini...
Chong Hee Kim, Gildas Avoine, François Koeu...
FSE
2010
Springer
146views Cryptology» more  FSE 2010»
14 years 28 days ago
A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
Mridul Nandi
CONCUR
2005
Springer
14 years 3 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
CN
2007
116views more  CN 2007»
13 years 9 months ago
Scalability and security in biased many-to-one communication
In multicast communication, a source transmits the same content to a set of receivers. Current protocols for multicast follow a tree communication model which makes them scalable....
Francesc Sebé, Josep Domingo-Ferrer