Sciweavers

648 search results - page 64 / 130
» Authenticated hash tables
Sort
View
SIGOPSE
2004
ACM
14 years 1 months ago
The lonely NATed node
In this paper we take the position that current research in the area of distributed systems has all but forgotten about one of the largest collective Internet resources - the NATe...
Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S...
CSFW
2007
IEEE
14 years 2 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
INFOCOM
2009
IEEE
14 years 2 months ago
Time Valid One-Time Signature for Time-Critical Multicast Data Authentication
Abstract—It is challenging to provide authentication to timecritical multicast data, where low end-to-end delay is of crucial importance. Consequently, it requires not only effi...
Qiyan Wang, Himanshu Khurana, Ying Huang, Klara Na...
ICMCS
2005
IEEE
116views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Distance-Level Fusion Strategies for Online Signature Verification
In this paper an approach for combining online signature authentication experts will be proposed. The different experts are based on one feature extraction method presented in our...
Tobias Scheidat, Claus Vielhauer, Jana Dittmann
CRYPTO
2000
Springer
277views Cryptology» more  CRYPTO 2000»
13 years 11 months ago
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
Jürgen Bierbrauer, Holger Schellwat