38 search results - page 3 / 8 » Dining Cryptographers Revisited |
CORR
2000
Springer
13 years 6 months ago
2000
Springer
We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing...
FOSSACS
2008
Springer
13 years 7 months ago
2008
Springer
Protocols for information-hiding often use randomized primitives to obfuscate the link between the observables and the information to be protected. The degree of protection provide...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationallybounded pl...
PAIRING
2009
Springer
14 years 24 days ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
FOSSACS
2009
Springer
14 years 1 months ago
2009
Springer
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...