947 search results - page 144 / 190 » Provable Implementations of Security Protocols |
154
Voted
ICQNM
2008
IEEE
15 years 10 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 ...
157
Voted
PKC
2010
Springer
15 years 7 months ago
2010
Springer
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
145
Voted
CRYPTO
2006
Springer
15 years 7 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...
126
Voted
CRYPTO
2010
Springer
15 years 4 months ago
2010
Springer
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...
119
Voted
EUROSYS
2007
ACM
16 years 22 days ago
2007
ACM
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...