Sciweavers

362 search results - page 37 / 73
» Abstraction in Cryptography
Sort
View
EUROCRYPT
2003
Springer
14 years 1 months ago
Nearly One-Sided Tests and the Goldreich-Levin Predicate
Abstract. We study statistical tests with binary output that rarely outputs one, which we call nearly one-sided statistical tests. We provide an efficient reduction establishing im...
Gustav Hast
EUROCRYPT
2003
Springer
14 years 1 months ago
The GHS Attack Revisited
Abstract. We generalize the Weil descent construction of the GHS attack to arbitrary Artin-Schreier extensions. We give a formula for the characteristic polynomial of Frobenius of ...
Florian Hess
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Minimal Complete Primitives for Secure Multi-party Computation
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Raf...
EVOW
2006
Springer
14 years 12 days ago
BeeHiveGuard: A Step Towards Secure Nature Inspired Routing Algorithms
Abstract. Nature inspired routing protocols for fixed and mobile networks are becoming an active area of research. However, analyzing their security threats and countering them hav...
Horst Wedde, Constantin Timm, Muddassar Farooq
FPL
2000
Springer
116views Hardware» more  FPL 2000»
14 years 10 days ago
High-Level Area and Performance Estimation of Hardware Building Blocks on FPGAs
Abstract. Field-programmable gate arrays (FPGAs) have become increasingly interesting in system design and due to the rapid technological progress ever larger devices are commercia...
Rolf Enzler, Tobias Jeger, Didier Cottet, Gerhard ...