Sciweavers

2237 search results - page 115 / 448
» On the Security of Random Sources
Sort
View
TWC
2010
14 years 11 months ago
Random access transport capacity
Abstract--We develop a new metric for quantifying end-toend throughput in multihop wireless networks, which we term random access transport capacity, since the interference model p...
Jeffrey G. Andrews, Steven Weber, Marios Kountouri...
ACSAC
2006
IEEE
15 years 11 months ago
An Internet Voting System Supporting User Privacy
This work introduces the A system1 , an Internetbased, free and open source electronic voting system which employs strong cryptography. Our system is a fully functiona...
Aggelos Kiayias, Michael Korman, David Walluck
ICALP
2004
Springer
15 years 10 months ago
Group Spreading: A Protocol for Provably Secure Distributed Name Service
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
Baruch Awerbuch, Christian Scheideler
CORR
2011
Springer
167views Education» more  CORR 2011»
15 years 3 days ago
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
Carolin Lunemann, Jesper Buus Nielsen
155
Voted
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
15 years 9 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto