38 search results - page 7 / 8 » Dining Cryptographers Revisited |
PROVSEC
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempt...
ENTCS
2006
13 years 5 months ago
2006
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
CCS
2007
ACM
13 years 12 months ago
2007
ACM
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...
CRYPTO
2010
Springer
13 years 6 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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...