947 search results - page 144 / 190 » Provable Implementations of Security Protocols |
204
click to vote
ICQNM
2008
IEEE
16 years 17 days 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 ...
192
click to vote
PKC
2010
Springer
15 years 10 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...
176
click to vote
CRYPTO
2006
Springer
15 years 9 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...
153
click to vote
CRYPTO
2010
Springer
15 years 7 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...
152
click to vote
EUROSYS
2007
ACM
16 years 3 months 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...