659 search results - page 3 / 132 » Compiling and securing cryptographic protocols |
114
click to vote
ESORICS
2004
Springer
15 years 6 months ago
2004
Springer
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
218
Voted
EUROPKI
2009
Springer
14 years 11 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
123
Voted
CCS
2010
ACM
15 years 1 months ago
2010
ACM
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
104
Voted
CCS
2009
ACM
15 years 8 months ago
2009
ACM
We enforce information flow policies in programs that run at multiple locations, with diverse levels of security. We build a compiler from a small imperative language with locali...
97
Voted
ASM
2008
ASM
15 years 3 months ago
2008
ASM
We address the proof-based development of cryptographic protocols satisfying security properties. Communication channels are supposed to be unsafe. Analysing cryptographic protocol...