1777 search results - page 168 / 356 » Programming Cryptographic Protocols |
196
Voted
FOCS
2009
IEEE
16 years 27 days 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...
139
click to vote
FSTTCS
2009
Springer
16 years 21 days 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 ...
154
click to vote
ICASSP
2008
IEEE
16 years 18 days 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...
154
click to vote
CCS
2007
ACM
16 years 10 days 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...
195
Voted
JACM
2002
15 years 5 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: ...