Classical Cryptographic Protocols in a Quantum World-Reference-Cited by-同舟云学术

Classical Cryptographic Protocols in a Quantum World

Published:2011 Issue: Volume: Page:411-428
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2011
language:
Short-container-title:

Author:

Hallgren Sean,Smith Adam,Song Fang

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22792-9_23.pdf

Reference51 articles.

1. Barak, B., Sahai, A.: How to play almost any mental game over the net - concurrent composition via super-polynomial simulation. In: FOCS, pp. 543–552. IEEE, Los Alamitos (2005)

2. Lecture Notes in Computer Science;D. Beaver,2002

3. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: STOC, pp. 503–513. ACM, New York (1990)

4. Lecture Notes in Computer Science;M. Bellare,2006

5. Ben-Or, M., Crépeau, C., Gottesman, D., Hassidim, A., Smith, A.: Secure multiparty quantum computation with (only) a strict honest majority. In: FOCS, pp. 249–260. IEEE, Los Alamitos (2006)

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Approach to Post-Quantum Non-Malleability;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security;Quantum;2023-03-09

3. Oblivious Transfer from Zero-Knowledge Proofs;Advances in Cryptology – ASIACRYPT 2023;2023

4. On Concurrent Multi-party Quantum Computation;Advances in Cryptology – CRYPTO 2023;2023

5. Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round;Advances in Cryptology – CRYPTO 2022;2022