Shannon [Sha48, Sha49] in celebrated works had shown that n bits of shared key is necessary and suļ¬cient to transmit n-bit classical information in an information-theoretically ...
Andris Ambainis, Michele Mosca, Alain Tapp, Ronald...
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriļ...
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environ...
P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P....
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...