Sciweavers

659 search results - page 83 / 132
» Compiling and securing cryptographic protocols
Sort
View
AINTEC
2006
Springer
15 years 4 months ago
Proactive Resilience to Dropping Nodes in Mobile Ad Hoc Networks
Abstract. Proactive routing protocols for mobile ad hoc networks currently offer few mechanisms to detect and/or counter malevolent nodes. Stability and performance of most, if not...
Ignacy Gawedzki, Khaldoun Al Agha
89
Voted
ENTCS
2006
103views more  ENTCS 2006»
15 years 17 days ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
EUROCRYPT
2009
Springer
16 years 1 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai
83
Voted
TCC
2010
Springer
236views Cryptology» more  TCC 2010»
15 years 9 months ago
From Passive to Covert Security at Low Cost
Aumann and Lindell defined security against covert attacks, where the adversary is malicious, but is only caught cheating with a certain probability, where the idea is that in man...
Ivan Damgård, Martin Geisler, Jesper Buus Ni...
78
Voted
SP
2009
IEEE
15 years 7 months ago
The Mastermind Attack on Genomic Data
In this paper, we study the degree to which a genomic string, Q, leaks details about itself any time it engages in comparison protocols with a genomic querier, Bob, even if those ...
Michael T. Goodrich