1777 search results - page 168 / 356 » Programming Cryptographic Protocols |
147
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
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...
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
103
click to vote
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
Secure wireless communications is a challenging problem due to the shared nature of the wireless medium. Most existing security protocols apply cryptographic techniques for bit sc...
CCS
2007
ACM
15 years 7 months ago
2007
ACM
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier...
133
click to vote
JACM
2002
15 years 1 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...