27 search results - page 2 / 6 » Biased Bit Commitment and Applications |
EUROCRYPT
2000
Springer
13 years 9 months ago
2000
Springer
Alice wants to prove that she is young enough to borrow money from her bank, without revealing her age. She therefore needs a tool for proving that a committed number lies in a spe...
ASIACRYPT
2005
Springer
13 years 10 months ago
2005
Springer
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
FSE
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
ICONIP
2008
13 years 6 months ago
2008
Practical Recurrent Learning (PRL) has been proposed as a simple learning algorithm for recurrent neural networks[1][2]. This algorithm enables learning with practical order O(n2 )...
GLOBECOM
2008
IEEE
13 years 5 months ago
2008
IEEE
Abstract--Current implementations of BitTorrent-like P2P applications ignore the underlying Internet topology hence incur a large amount of traffic both inside an Internet Service ...