Sciweavers

1618 search results - page 209 / 324
» Testing random number generators
Sort
View
103
Voted
FC
2007
Springer
141views Cryptology» more  FC 2007»
15 years 8 months ago
The Unbearable Lightness of PIN Cracking
Responding to the PIN cracking attacks from Berkman and Ostrovsky (FC 2007), we outline a simple solution called salted-PIN. A randomly generated salt value of adequate length (e.g...
Omer Berkman, Odelia Moshe Ostrovsky
131
Voted
ACSAC
2000
IEEE
15 years 7 months ago
Efficient Commerce Protocols based on One-Time Pads
We present a new commerce protocol that allows customers and merchants to conduct face-to-face creditcard authorizations with a credit card company securely with the option of ano...
Michael A. Schneider, Edward W. Felten
149
Voted
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 6 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
102
Voted
ICWN
2008
15 years 4 months ago
A Framework of Authentic Post-Issuance Program Modification for Multi-Application Smart Cards
Authentic program modification is very important for a multi-application smart card system since applications in the system are realized after the issuance of the smart card. In t...
Mohammad Mesbah Uddin, Salahuddin Muhammad Salim Z...
PVLDB
2010
120views more  PVLDB 2010»
15 years 29 days ago
Sampling the Repairs of Functional Dependency Violations under Hard Constraints
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
George Beskales, Ihab F. Ilyas, Lukasz Golab