Sciweavers

163 search results - page 22 / 33
» Computationally Convincing Proofs of Knowledge
Sort
View
FOCS
2000
IEEE
14 years 1 days ago
Zaps and Their Applications
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
Cynthia Dwork, Moni Naor
IPPS
1999
IEEE
13 years 12 months ago
Reconfigurable Parallel Sorting and Load Balancing: HeteroSort
HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optim...
Emmett Davis, Bonnie Holte Bennett, Bill Wren, Lin...
HUC
2007
Springer
13 years 11 months ago
Amigo: Proximity-Based Authentication of Mobile Devices
Securing interactions between devices that do not know each other a priori is an important and challenging task. We present Amigo, a technique to authenticate co-located devices us...
Alex Varshavsky, Adin Scannell, Anthony LaMarca, E...
PKC
2000
Springer
132views Cryptology» more  PKC 2000»
13 years 11 months ago
The Composite Discrete Logarithm and Secure Authentication
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...
David Pointcheval

Publication
545views
14 years 4 months ago
Reid et al.'s Distance Bounding Protocol and Mafia Fraud Attacks over Noisy Channels
Distance bounding protocols are an effective countermeasure against relay attacks including distance fraud, mafia fraud and terrorist fraud attacks. Reid et al. proposed the first ...
A. Mitrokotsa, C. Dimitrakakis, P. Peris-Lopez, J....