403 search results - page 52 / 81 » An algebra for commitment protocols |
108
click to vote
PKC
2010
Springer
15 years 3 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...
CRYPTO
2010
Springer
15 years 29 days 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...
108
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Consider the problem of verifying security properties of a cryptographic protocol coded in C. We propose an automatic solution that needs neither a pre-existing protocol descripti...
PRDC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—In this paper, we study algebraic aggregate computations in Sensor Networks. The main contribution is the presentation of an early-stopping protocol that computes the av...
101
click to vote
IFIP
2009
Springer
14 years 9 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...