Sciweavers

154 search results - page 14 / 31
» Proving Group Protocols Secure Against Eavesdroppers
Sort
View
FSE
2006
Springer
101views Cryptology» more  FSE 2006»
15 years 1 months ago
Pseudorandom Permutation Families over Abelian Groups
We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. We prove piling-up lemmas for the generalized different...
Louis Granboulan, Éric Levieil, Gilles Pire...
SIAMCOMP
2011
14 years 4 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
ACNS
2008
Springer
103views Cryptology» more  ACNS 2008»
15 years 4 months ago
PUF-HB: A Tamper-Resilient HB Based Authentication Protocol
We propose a light-weight protocol for authentication of low-power devices. Our construction PUF-HB merges the positive qualities of two families of authentication functions. PUF ...
Ghaith Hammouri, Berk Sunar
SP
2008
IEEE
285views Security Privacy» more  SP 2008»
15 years 4 months ago
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
Decentralized distributed systems such as peer-to-peer systems are particularly vulnerable to sybil attacks, where a malicious user pretends to have multiple identities (called sy...
Haifeng Yu, Phillip B. Gibbons, Michael Kaminsky, ...
EUROCRYPT
2000
Springer
15 years 1 months ago
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
Abstract. When designing password-authenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow ...
Victor Boyko, Philip D. MacKenzie, Sarvar Patel