719 search results - page 109 / 144 » Proving Security Protocols Correct |
POPL
2000
ACM
15 years 2 months ago
2000
ACM
Adopting a programming-language perspective, we study the problem of implementing authentication in a distributed system. We define a process calculus with constructs for authent...
80
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
105
Voted
ICQNM
2008
IEEE
15 years 4 months ago
2008
IEEE
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
ESORICS
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Proofs of security protocols typically employ simple abstractions of cryptographic operations, so that large parts of such proofs pendent of cryptographic details. The ty...