Sciweavers

555 search results - page 82 / 111
» From ABZ to Cryptography
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 10 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
POPL
2008
ACM
14 years 10 months ago
Cryptographically sound implementations for typed information-flow security
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
Cédric Fournet, Tamara Rezk
MOBISYS
2005
ACM
14 years 9 months ago
Shake them up!: a movement-based pairing protocol for CPU-constrained devices
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
Claude Castelluccia, Pars Mutaf
FOCS
2009
IEEE
14 years 4 months ago
Extracting Correlations
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
ACNS
2008
Springer
103views Cryptology» more  ACNS 2008»
14 years 4 months ago
Pushback for Overlay Networks: Protecting Against Malicious Insiders
Peer-to-Peer (P2P) overlay networks are a flexible way of creating decentralized services. Although resilient to external Denial of Service attacks, overlay networks can be render...
Angelos Stavrou, Michael E. Locasto, Angelos D. Ke...