Sciweavers

12 search results - page 2 / 3
» Universally Composable Symbolic Security Analysis
Sort
View
EUROCRYPT
2006
Springer
13 years 9 months ago
Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
We propose simple, realistic protocols for polling that allow the responder to plausibly repudiate his response, while at the same time allow accurate statistical analysis of poll ...
Tal Moran, Moni Naor
CRYPTO
2005
Springer
137views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
A Formal Treatment of Onion Routing
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the crypto...
Jan Camenisch, Anna Lysyanskaya
IFIP
2010
Springer
13 years 2 days ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
IACR
2011
105views more  IACR 2011»
12 years 4 months ago
Leakage Tolerant Interactive Protocols
We put forth a framework for expressing security requirements from interactive protocols in the presence of arbitrary leakage. This allows capturing different levels of leakage to...
Nir Bitansky, Ran Canetti, Shai Halevi
FC
2005
Springer
142views Cryptology» more  FC 2005»
13 years 10 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova