Sciweavers

84 search results - page 11 / 17
» On the Security Loss in Cryptographic Reductions
Sort
View
EUROCRYPT
2003
Springer
14 years 9 days 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
CAV
2007
Springer
111views Hardware» more  CAV 2007»
13 years 11 months ago
Verification Across Intellectual Property Boundaries
In many industries, the share of software components provided by third-party suppliers is steadily increasing. As the suppliers seek to secure their intellectual property (IP) righ...
Sagar Chaki, Christian Schallhart, Helmut Veith
IACR
2011
82views more  IACR 2011»
12 years 6 months ago
Wild McEliece Incognito
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of se...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
DEXAW
2003
IEEE
122views Database» more  DEXAW 2003»
14 years 11 days ago
Fairness in Wallets with Observer
We examine the interference of fairness and observers in digital coin systems. Since copying of coins cannot be prevented cryptographically in anonymous off-line coin systems, dou...
Heike Neumann, Thomas Schwarzpaul
EUROCRYPT
2007
Springer
14 years 1 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...