Sciweavers

1769 search results - page 161 / 354
» Cryptography
Sort
View
TCC
2010
Springer
170views Cryptology» more  TCC 2010»
16 years 13 days ago
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
LATA
2009
Springer
15 years 10 months ago
A Cryptosystem Based on the Composition of Reversible Cellular Automata
We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain te...
Adam Clarridge, Kai Salomaa
134
Voted
ACNS
2009
Springer
162views Cryptology» more  ACNS 2009»
15 years 10 months ago
Secure Hamming Distance Based Computation and Its Applications
Abstract. This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols f...
Ayman Jarrous, Benny Pinkas
ACNS
2009
Springer
170views Cryptology» more  ACNS 2009»
15 years 10 months ago
Fragility of the Robust Security Network: 802.11 Denial of Service
The upcoming 802.11w amendment to the 802.11 standard eliminates the 802.11 deauthentication and disassociation Denial of Service (DoS) vulnerabilities. This paper presents two oth...
Martin Eian
132
Voted
CSR
2009
Springer
15 years 10 months ago
A Feebly Secure Trapdoor Function
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
Edward A. Hirsch, Sergey I. Nikolenko