462 search results - page 8 / 93 » Authentication of Quantum Messages |
IPL
2006
13 years 8 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
FSE
1997
Springer
14 years 10 days ago
1997
Springer
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
MADNES
2005
Springer
14 years 2 months ago
2005
Springer
In wireless sensor networks, a sensor node broadcasts its data (such as routing information, beacon messages or meta-data) to all its neighbors, which is called local broadcast. A ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We demonstrate a two-player communication problem that can be solved in the oneway quantum model by a 0-error protocol of cost O (log n) but requires exponentially more communicat...
SECPERU
2006
IEEE
14 years 2 months ago
2006
IEEE
The objective of this paper is to propose a cryptographic protocol which provides authenticity in the exchange of information between two entities without using any shared secret ...