A Quantum Goldreich-Levin Theorem with Cryptographic Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Reasoning about probabilistic sequential programs
Theoretical Computer Science
Can quantum mechanics help distributed computing?
ACM SIGACT News
On the Power of Quantum Encryption Keys
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Entropic security in quantum cryptography
Quantum Information Processing
Quantum entropic security and approximate quantum encryption
IEEE Transactions on Information Theory
Measurement-based and universal blind quantum computation
SFM'10 Proceedings of the Formal methods for quantitative aspects of programming languages, and 10th international conference on School on formal methods for the design of computer, communication and software systems
Secure two-party quantum evaluation of unitaries against specious adversaries
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Classical capacity of a noiseless quantum channel assisted by noisy entanglement
Quantum Information & Computation
Quantum Information & Computation
Quantum Information & Computation
Secure assisted quantum computation
Quantum Information & Computation
Invertible quantum operations and perfect encryption of quantum states
Quantum Information & Computation
Reasoning about states of probabilistic sequential programs
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The universal composable security of quantum key distribution
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
A quantum cipher with near optimal key-recycling
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Private quantum channels, conditional expectations, and trace vectors
Quantum Information & Computation
Quantum McEliece public-key cryptosystem
Quantum Information & Computation
Journal of the ACM (JACM)
Symmetric quantum fully homomorphic encryption with perfect security
Quantum Information Processing
| Hi-index | 0.06 |
For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...