Sciweavers

462 search results - page 2 / 93
» Authentication of Quantum Messages
Sort
View
ISHPC
1999
Springer
13 years 10 months ago
Integrity and Performance in Network Attached Storage
Computer security is of growing importance in the increasingly networked computing environment.This work examines the issue of high-performance network security, specifically int...
Howard Gobioff, David Nagle, Garth A. Gibson
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
13 years 11 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
JUCS
2008
144views more  JUCS 2008»
13 years 6 months ago
New Results on NMAC/HMAC when Instantiated with Popular Hash Functions
Abstract: Message Authentication Code (MAC) algorithms can provide cryptographically secure authentication services. One of the most popular algorithms in commercial
Christian Rechberger, Vincent Rijmen
JACM
2006
146views more  JACM 2006»
13 years 6 months ago
Limits on the ability of quantum states to convey classical messages
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
Ashwin Nayak, Julia Salzman
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
13 years 11 months ago
Quantum Arthur-Merlin Games
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...
Chris Marriott, John Watrous