Sciweavers

111 search results - page 17 / 23
» Errors in Computational Complexity Proofs for Protocols
Sort
View
93
Voted
EUROCRYPT
2005
Springer
15 years 5 months ago
Secure Remote Authentication Using Biometric Data
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are n...
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafai...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 6 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
15 years 4 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
DIM
2005
ACM
15 years 1 months ago
Establishing and protecting digital identity in federation systems
We develop solutions for the security and privacy of user identity information in a federation. By federation we mean a group of organizations or service providers which have buil...
Abhilasha Bhargav-Spantzel, Anna Cinzia Squicciari...
87
Voted
EMNETS
2007
15 years 3 months ago
Robust node localization for wireless sensor networks
The node localization problem in Wireless Sensor Networks has received considerable attention, driven by the need to obtain a higher location accuracy without incurring a large, p...
Radu Stoleru, John A. Stankovic, Sang Hyuk Son