Sciweavers

3115 search results - page 493 / 623
» Synthesizing Secure Protocols
Sort
View
COMCOM
2006
70views more  COMCOM 2006»
15 years 5 months ago
Secret instantiation in ad-hoc networks
In this paper, we focus our attention on the problem of assigning initial secrets to users in ad-hoc network (respectively, sensors in a sensor network) so that they can use those...
Sandeep S. Kulkarni, Mohamed G. Gouda, Anish Arora
IJNSEC
2007
89views more  IJNSEC 2007»
15 years 5 months ago
Vulnerabilities in the Adachi-Aoki-Komano-Ohta Micropayment Scheme
Rivest and Shamir presented two simple micropayment schemes, “PayWord” and “MicroMint,” for making small purchases over the Internet [14]. Recently, Adachi et al. have poi...
Minho Kim, Çetin Kaya Koç
CORR
2010
Springer
87views Education» more  CORR 2010»
15 years 4 months ago
Quantum money from knots
Quantum money is a cryptographic protocol in which a mint can produce a quantum state, no one else can copy the state, and anyone (with a quantum computer) can verify that the sta...
Edward Farhi, David Gosset, Avinatan Hassidim, And...
CORR
2011
Springer
187views Education» more  CORR 2011»
15 years 23 days ago
Failure of A Mix Network
A mix network by Wikstrom fails in correctness, provable privacy and soundness. Its claimed advantages in security and efficiency are compromised. The analysis in this paper illus...
Kun Peng
FOCS
2009
IEEE
16 years 15 days ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao