Sciweavers

2363 search results - page 271 / 473
» How Secure is RFID
Sort
View
ACISP
2005
Springer
16 years 1 months ago
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
Arjen K. Lenstra, Benne de Weger
CCS
2005
ACM
16 years 1 months ago
On fairness in simulatability-based cryptographic systems
Simulatability constitutes the cryptographic notion of a secure refinement and has asserted its position as one of the fundamental concepts of modern cryptography. Although simula...
Michael Backes, Dennis Hofheinz, Jörn Mü...
CCS
2005
ACM
16 years 1 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...
FC
2005
Springer
110views Cryptology» more  FC 2005»
16 years 29 days ago
Approximate Message Authentication and Biometric Entity Authentication
Approximate Message Authentication Code (AMAC) is a recently introduced cryptographic primitive with several applications in the areas of cryptography and coding theory. Briefly s...
Giovanni Di Crescenzo, R. F. Graveman, Renwei Ge, ...
ISI
2005
Springer
16 years 28 days ago
Private Mining of Association Rules
This paper introduces a new approach to a problem of data sharing among multiple parties, without disclosing the data between the parties. Our focus is data sharing among two parti...
Justin Z. Zhan, Stan Matwin, LiWu Chang