111 search results - page 11 / 23 » Errors in Computational Complexity Proofs for Protocols |
WCNC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract—Recent advances in the technology of wireless electronic devices have made possible to build ad–hoc Wireless Sensor Networks (WSNs) using inexpensive nodes consisting ...
APCSAC
2004
IEEE
14 years 10 days ago
2004
IEEE
As device sizes continue shrinking, lower charges are needed to activate gates, and consequently ever smaller external events (such as single ionizing particles of naturally occurr...
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
COCO
2004
Springer
14 years 2 months ago
2004
Springer
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...