Sciweavers

3504 search results - page 575 / 701
» Secure protocol composition
Sort
View
CCS
2009
ACM
16 years 2 months ago
On the feasibility of launching the man-in-the-middle attacks on VoIP from remote attackers
The man-in-the-middle (MITM) attack has been shown to be one of the most serious threats to the security and trust of existing VoIP protocols and systems. For example, the MITM wh...
Ruishan Zhang, Xinyuan Wang, Ryan Farley, Xiaohui ...
138
Voted
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 2 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
16 years 1 months ago
Efficient anonymity-preserving data collection
The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history an...
Justin Brickell, Vitaly Shmatikov
TCC
2007
Springer
104views Cryptology» more  TCC 2007»
15 years 7 months ago
Unifying Classical and Quantum Key Distillation
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state ρABE. In addition, ...
Matthias Christandl, Artur Ekert, Michal Horodecki...
FC
2010
Springer
169views Cryptology» more  FC 2010»
15 years 4 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea