659 search results - page 60 / 132 » Compiling and securing cryptographic protocols |
MMMACNS
2001
Springer
15 years 5 months ago
2001
Springer
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptoti...
88
Voted
ACNS
2010
Springer
15 years 5 months ago
2010
Springer
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
102
click to vote
CRYPTO
2006
Springer
15 years 4 months ago
2006
Springer
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
111
click to vote
ESORICS
2012
Springer
13 years 2 months ago
2012
Springer
We show that it is possible to achieve perfect forward secrecy in two-message key exchange (KE) protocols that satisfy even stronger security properties than provided by the extend...
ESORICS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositio...