{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2019,11,23]],"date-time":"2019-11-23T11:17:14Z","timestamp":1574507834182},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"URL":"http:\/\/www.springer.com\/tdm","start":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T00:00:00Z","timestamp":1302566400000},"delay-in-days":0,"content-version":"tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00145-011-9103-4","type":"journal-article","created":{"date-parts":[[2011,4,21]],"date-time":"2011-04-21T14:56:07Z","timestamp":1303397767000},"page":"528-555","source":"Crossref","is-referenced-by-count":9,"title":["Computational Indistinguishability Between Quantum States and Its Cryptographic Application"],"prefix":"10.1007","volume":"25","author":[{"given":"Akinori","family":"Kawachi","sequence":"first","affiliation":[]},{"given":"Takeshi","family":"Koshiba","sequence":"additional","affiliation":[]},{"given":"Harumichi","family":"Nishimura","sequence":"additional","affiliation":[]},{"given":"Tomoyuki","family":"Yamakami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,12]]},"reference":[{"key":"9103_CR1","series-title":"LNCS","first-page":"323","volume-title":"Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science","author":"M. Adcock","year":"2002","unstructured":"M. Adcock, R. Cleve, A quantum Goldreich-Levin theorem with cryptographic applications, in Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science. LNCS, vol. 2285 (Springer, Berlin, 2002), pp. 323\u2013334"},{"issue":"1","key":"9103_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1137\/060648829","volume":"37","author":"D. Aharonov","year":"2007","unstructured":"D. Aharonov, A. Ta-Shma, Adiabatic quantum state generation. SIAM J. Comput. 37(1), 47\u201382 (2007)","journal-title":"SIAM J. Comput."},{"key":"9103_CR3","author":"M. Ajtai","first-page":"99","year":"1996","unstructured":"M. Ajtai, Generating hard instances of lattice problems (extended abstract), in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (1996), pp. 99\u2013108","volume-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing"},{"key":"9103_CR4","author":"M. Ajtai","first-page":"284","year":"1997","unstructured":"M. Ajtai, C. Dwork, A public-key cryptosystem with worst-case\/average-case equivalence, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing (1997), pp. 284\u2013293. See also ECCC TR96-065","volume-title":"Proceedings of the 29th Annual ACM Symposium on Theory of Computing"},{"issue":"5","key":"9103_CR5","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1016\/j.ic.2006.02.002","volume":"204","author":"V. Arvind","year":"2006","unstructured":"V. Arvind, P.P. Kurur, Graph isomorphism is in SPP. Inf. Comput. 204(5), 835\u2013852 (2006)","journal-title":"Inf. Comput."},{"key":"9103_CR6","author":"D. Bacon","first-page":"469","year":"2005","unstructured":"D. Bacon, A.M. Childs, W. van Dam, From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (2005), pp. 469\u2013478","volume-title":"Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"9103_CR7","author":"M. Bellare","first-page":"26","year":"1998","unstructured":"M. Bellare, A. Desai, D. Pointcheval, P. Rogaway, Relations among notions of security for public-key encryption schemes, in Advances in Cryptology\u2014CRYPTO\u201998 (Springer, Berlin, 1998), pp. 26\u201345","volume-title":"Advances in Cryptology\u2014CRYPTO\u201998"},{"key":"9103_CR8","author":"C.H. Bennett","first-page":"175","year":"1984","unstructured":"C.H. Bennett, G. Brassard, Quantum cryptography: public key distribution and coin tossing, in Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing (1984), pp. 175\u2013179","volume-title":"Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing"},{"issue":"4","key":"9103_CR9","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum, S. Micali, How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9103_CR10","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1137\/S0097539705446974","volume":"36","author":"A. Bogdanov","year":"2006","unstructured":"A. Bogdanov, L. Trevisan, On worst-case to average-case reductions for NP problems. SIAM J. Comput. 36(4), 1119\u20131159 (2006)","journal-title":"SIAM J. Comput."},{"key":"9103_CR11","series-title":"LNCS","first-page":"424","volume-title":"Advances in Cryptology\u2014CRYPTO\u201995","author":"D. Boneh","year":"1995","unstructured":"D. Boneh, R.J. Lipton, Quantum cryptanalysis of hidden linear functions (extended abstract), in Advances in Cryptology\u2014CRYPTO\u201995. LNCS, vol. 963 (Springer, Berlin, 1995), pp. 424\u2013437"},{"key":"9103_CR12","series-title":"LNCS","first-page":"660","volume-title":"Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science","author":"M. Cr\u00e2smaru","year":"2004","unstructured":"M. Cr\u00e2smaru, C. Gla\u00dfer, K.W. Regan, S. Sengupta, A protocol for serializing unique strategies, in Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science. LNCS, vol. 3153 (Springer, Berlin, 2004), pp. 660\u2013672"},{"key":"9103_CR13","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/978-3-540-24638-1_21","volume-title":"Proceedings of the 1st Theory of Cryptography Conference","author":"C. Cr\u00e9peau","year":"2004","unstructured":"C. Cr\u00e9peau, P. Dumais, D. Mayers, L. Salvail, Computational collapse of quantum state with application to oblivious transfer, in Proceedings of the 1st Theory of Cryptography Conference. LNCS, vol. 2951 (Springer, Berlin, 2004), pp. 374\u2013393"},{"key":"9103_CR14","series-title":"LNCS","first-page":"60","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201901","author":"C. Cr\u00e9peau","year":"2001","unstructured":"C. Cr\u00e9peau, F. L\u00e9gar\u00e9, L. Salvail, How to convert the flavor of a quantum bit commitment, in Advances in Cryptology\u2014EUROCRYPT\u201901. LNCS, vol. 2045 (Springer, Berlin, 2001), pp. 60\u201377"},{"key":"9103_CR15","series-title":"LNCS","first-page":"254","volume-title":"Advances in Cryptology\u2014CRYPTO\u201904","author":"I. Damg\u00e5rd","year":"2004","unstructured":"I. Damg\u00e5rd, S. Fehr, L. Salvail, Zero-knowledge proofs and string commitments withstanding quantum attacks, in Advances in Cryptology\u2014CRYPTO\u201904. LNCS, vol. 3152 (Springer, Berlin, 2004), pp. 254\u2013272"},{"key":"9103_CR16","unstructured":"S.-P. Desrosier, De la cryptographie sur les corps quadratiques rels. Master\u2019s thesis, Universit\u00e9 McGill, Montr\u00e9al, 2002"},{"issue":"6","key":"9103_CR17","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, M.E. Hellman, New directions in cryptography. IEEE Trans. Inf. Theory IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9103_CR18","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/3-540-45539-6_21","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2000","author":"P. Dumais","year":"2000","unstructured":"P. Dumais, D. Mayers, L. Salvail, Perfectly concealing quantum bit commitment from any quantum one-way permutation, in Advances in Cryptology\u2014EUROCRYPT 2000. LNCS, vol. 1807 (Springer, Berlin, 2000), pp. 300\u2013315"},{"key":"9103_CR19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1006\/aama.2000.0699","volume":"25","author":"M. Ettinger","year":"2000","unstructured":"M. Ettinger, P. H\u00f8yer, On quantum algorithms for noncommutative hidden subgroups. Adv. Appl. Math. 25, 239\u2013251 (2000)","journal-title":"Adv. Appl. Math."},{"issue":"2","key":"9103_CR20","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"9103_CR21","series-title":"Randomness and Computation","first-page":"73","volume-title":"Advances in Computing Research","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, M. Sipser, Private coins versus public coins in interactive proof system, in Advances in Computing Research, ed. by S. Micali. Randomness and Computation, vol. 5 (JAI Press, London, 1989), pp. 73\u201390"},{"issue":"1","key":"9103_CR22","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00493-004-0009-8","volume":"24","author":"M. Grigni","year":"2004","unstructured":"M. Grigni, L.J. Schulman, M. Vazirani, U. Vazirani, Quantum mechanical algorithms for the nonabelian hidden subgroup problem. Combinatorica 24(1), 137\u2013154 (2004)","journal-title":"Combinatorica"},{"issue":"2","key":"9103_CR23","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/0217018","volume":"17","author":"J. Grollmann","year":"1988","unstructured":"J. Grollmann, A.L. Selman, Complexity measures for public-key cryptosystems. SIAM J. Comput. 17(2), 309\u2013335 (1988)","journal-title":"SIAM J. Comput."},{"key":"9103_CR24","unstructured":"S. Hallgren, Polynomial-time quantum algorithms for Pell\u2019s equation and the principal ideal problem. Journal of the ACM 54(1) (2007)","DOI":"10.1145\/1206035.1206039","doi-asserted-by":"crossref"},{"key":"9103_CR25","author":"S. Hallgren","first-page":"604","year":"2006","unstructured":"S. Hallgren, C. Moore, M. R\u00f6tteler, A. Russell, P. Sen, Limitations of quantum coset states for graph isomorphism, in Proceedings of the 38th ACM Symposium on Theory of Computing (2006), pp. 604\u2013617. See also quant-ph\/0511148 and quant-ph\/0511149","volume-title":"Proceedings of the 38th ACM Symposium on Theory of Computing"},{"issue":"4","key":"9103_CR26","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1137\/S009753970139450X","volume":"32","author":"S. Hallgren","year":"2003","unstructured":"S. Hallgren, A. Russell, A. Ta-Shma, The hidden subgroup problem and quantum computation using group representations. SIAM J. Comput. 32(4), 916\u2013934 (2003)","journal-title":"SIAM J. Comput."},{"key":"9103_CR27","first-page":"345","volume":"8","author":"M. Hayashi","year":"2008","unstructured":"M. Hayashi, A. Kawachi, H. Kobayashi, Quantum measurements for hidden subgroup problems with optimal sample complexity. Quantum Inf. Comput. 8, 345\u2013358 (2008)","journal-title":"Quantum Inf. Comput."},{"issue":"301","key":"9103_CR28","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. H\u00f6ffding","year":"1963","unstructured":"W. H\u00f6ffding, Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"9103_CR29","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"R. Impagliazzo, M. Naor, Efficient cryptographic schemes provably as secure as subset sum. J. Cryptol. 9(4), 199\u2013216 (1996)","journal-title":"J. Cryptol."},{"key":"9103_CR30","series-title":"LNCS","first-page":"268","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201905","author":"A. Kawachi","year":"2005","unstructured":"A. Kawachi, T. Koshiba, H. Nishimura, T. Yamakami, Computational indistinguishability between quantum states and its cryptographic application, in Advances in Cryptology\u2014EUROCRYPT\u201905. LNCS, vol. 3494 (Springer, Berlin, 2005), pp. 268\u2013284"},{"key":"9103_CR31","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-3-540-88403-3_12","volume-title":"Proceedings of the 2nd International Workshop on Post-Quantum Cryptography","author":"A. Kawachi","year":"2008","unstructured":"A. Kawachi, C. Portmann, On the power of quantum encryption keys, in Proceedings of the 2nd International Workshop on Post-Quantum Cryptography. LNCS, vol. 5299 (Springer, Berlin, 2008), pp. 165\u2013180"},{"key":"9103_CR32","author":"J. Kempe","first-page":"1118","year":"2005","unstructured":"J. Kempe, A. Shalev, The hidden subgroup problem and permutation group theory, in Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (2005), pp. 1118\u20131125","volume-title":"Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms"},{"key":"9103_CR33","unstructured":"A. Kitaev, Quantum measurements and the Abelian stabilizer problem (1995). quant-ph\/9511026"},{"key":"9103_CR34","series-title":"LNCS","first-page":"178","volume-title":"Proceedings of the 14th Annual International Conference on Algorithms and Computation","author":"H. Kobayashi","year":"2003","unstructured":"H. Kobayashi, Non-interactive quantum perfect and statistical zero-knowledge, in Proceedings of the 14th Annual International Conference on Algorithms and Computation. LNCS, vol. 2906 (Springer, Berlin, 2003), pp. 178\u2013188"},{"key":"9103_CR35","author":"J. K\u00f6bler","year":"1993","unstructured":"J. K\u00f6bler, U. Sch\u00f6ning, J. Tor\u00e1n, The Graph Isomorphism Problem: Its Structural Complexity (Birkh\u00e4user Boston, Cambridge, 1993)","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity","DOI":"10.1007\/978-1-4612-0333-9","doi-asserted-by":"crossref"},{"issue":"1","key":"9103_CR36","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G. Kuperberg","year":"2005","unstructured":"G. Kuperberg, A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35(1), 170\u2013188 (2005)","journal-title":"SIAM J. Comput."},{"issue":"17","key":"9103_CR37","doi-asserted-by":"crossref","first-page":"3410","DOI":"10.1103\/PhysRevLett.78.3410","volume":"78","author":"H.-K. Lo","year":"1997","unstructured":"H.-K. Lo, H.F. Chau, Is quantum bit commitment really possible? Phys. Rev. Lett. 78(17), 3410\u20133413 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"9103_CR38","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/dimacs\/011\/11","volume-title":"Groups and Computation","author":"E.M. Luks","year":"1993","unstructured":"E.M. Luks, Permutation groups and polynomial-time computation, in Groups and Computation, ed. by L. Finklestein, W.M. Kantor. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 5 (Am. Math. Soc., Providence, 1993), pp. 139\u2013175"},{"issue":"17","key":"9103_CR39","doi-asserted-by":"crossref","first-page":"3414","DOI":"10.1103\/PhysRevLett.78.3414","volume":"78","author":"D. Mayers","year":"1997","unstructured":"D. Mayers, Unconditionally secure quantum bit commitment is impossible. Phys. Rev. Lett. 78(17), 3414\u20133417 (1997)","journal-title":"Phys. Rev. Lett."},{"issue":"3","key":"9103_CR40","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1145\/382780.382781","volume":"48","author":"D. Mayers","year":"2001","unstructured":"D. Mayers, Unconditional security in quantum cryptography. J. ACM 48(3), 351\u2013406 (2001)","journal-title":"J. ACM"},{"issue":"1","key":"9103_CR41","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D. Micciancio","year":"2007","unstructured":"D. Micciancio, O. Regev, Worst-case to average-case reductions based on Gaussian measure. SIAM J. Comput. 37(1), 267\u2013302 (2007)","journal-title":"SIAM J. Comput."},{"key":"9103_CR42","unstructured":"C. Moore, A. Russell, The symmetric group defies strong Fourier sampling: Part II (2005). quant-ph\/0501066"},{"key":"9103_CR43","author":"C. Moore","first-page":"1106","year":"2004","unstructured":"C. Moore, D. Rockmore, A. Russell, L.J. Schulman, The hidden subgroup problem in affine groups: basis selection in Fourier sampling, in Proceedings of the 15th ACM\u2013SIAM Symposium on Discrete Algorithms (2004), pp. 1106\u20131115","volume-title":"Proceedings of the 15th ACM\u2013SIAM Symposium on Discrete Algorithms"},{"issue":"6","key":"9103_CR44","doi-asserted-by":"crossref","first-page":"1842","DOI":"10.1137\/050644896","volume":"37","author":"C. Moore","year":"2008","unstructured":"C. Moore, A. Russell, L.J. Schulman, The symmetric group defies strong Fourier sampling. SIAM J. Comput. 37(6), 1842\u20131864 (2008). See also quant-ph\/0501056 and quant-ph\/0501066","journal-title":"SIAM J. Comput."},{"key":"9103_CR45","author":"M.A. Nielsen","year":"2000","unstructured":"M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000)","volume-title":"Quantum Computation and Quantum Information"},{"key":"9103_CR46","author":"G.M. Nikolopoulos","volume":"77","year":"2008","unstructured":"G.M. Nikolopoulos, Applications of single-qubit rotations in quantum public-key cryptography. Phys. Rev. A 77, 032348 (2008)","journal-title":"Phys. Rev. A","DOI":"10.1103\/PhysRevA.77.032348","doi-asserted-by":"crossref"},{"key":"9103_CR47","author":"G.M. Nikolopoulos","volume":"79","year":"2009","unstructured":"G.M. Nikolopoulos, L.M. Ioannou, Deterministic quantum-public-key encryption: forward search attack and randomization. Phys. Rev. A 79, 042327 (2009)","journal-title":"Phys. Rev. A","DOI":"10.1103\/PhysRevA.79.042327","doi-asserted-by":"crossref"},{"key":"9103_CR48","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-44598-6_9","volume-title":"Advances in Cryptology\u2014CRYPTO 2000","author":"T. Okamoto","year":"2000","unstructured":"T. Okamoto, K. Tanaka, S. Uchiyama, Quantum public-key cryptosystems, in Advances in Cryptology\u2014CRYPTO 2000. LNCS, vol. 1880 (Springer, Berlin, 2000), pp. 147\u2013165"},{"issue":"6","key":"9103_CR49","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1145\/1039488.1039490","volume":"51","author":"O. Regev","year":"2004","unstructured":"O. Regev, New lattice-based cryptographic constructions. J. ACM 51(6), 899\u2013942 (2004)","journal-title":"J. ACM"},{"issue":"3","key":"9103_CR50","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1137\/S0097539703440678","volume":"33","author":"O. Regev","year":"2004","unstructured":"O. Regev, Quantum computation and lattice problems. SIAM J. Comput. 33(3), 738\u2013760 (2004)","journal-title":"SIAM J. Comput."},{"key":"9103_CR51","unstructured":"R. Renner, Security of quantum key distribution. Ph.D. thesis, ETH Zurich (2005). quant-ph\/0512258"},{"issue":"6","key":"9103_CR52","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O. Regev","year":"2009","unstructured":"O. Regev, On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34 (2009)","journal-title":"J. ACM"},{"key":"9103_CR53","author":"D. Robinson","year":"1995","unstructured":"D. Robinson, A Course in the Theory of Groups (Springer, Berlin, 1995)","volume-title":"A Course in the Theory of Groups"},{"key":"9103_CR54","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0022-0000(88)90010-4","volume":"37","author":"U. Sch\u00f6ning","year":"1988","unstructured":"U. Sch\u00f6ning, Graph isomorphism is in the low hierarchy. J. Comput. Syst. Sci. 37, 312\u2013323 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"9103_CR55","unstructured":"A. Schmidt, Quantum algorithms for many-to-one functions to solve the regulator and the principal ideal problem (2009). arXiv:0912.4807"},{"issue":"5","key":"9103_CR56","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"P.W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"9103_CR57","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1103\/PhysRevLett.85.441","volume":"85","author":"P.W. Shor","year":"2000","unstructured":"P.W. Shor, J. Preskill, Simple proof of security of the BB84 quantum key distribution protocol. Phys. Rev. Lett. 85, 441\u2013444 (2000)","journal-title":"Phys. Rev. Lett."},{"key":"9103_CR58","author":"M. Tompa","first-page":"472","year":"1987","unstructured":"M. Tompa, H. Woll, Random self-reducibility and zero knowledge interactive proofs of possession of information, in Proceedings of the 28th IEEE Symposium on Foundations of Computer Science (1987), pp. 472\u2013482","volume-title":"Proceedings of the 28th IEEE Symposium on Foundations of Computer Science"},{"key":"9103_CR59","author":"J. Watrous","first-page":"459","year":"2002","unstructured":"J. Watrous, Limits on the power of quantum statistical zero-knowledge, in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (2002), pp. 459\u2013468","volume-title":"Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science"},{"key":"9103_CR60","author":"A.C.-C. Yao","first-page":"80","year":"1982","unstructured":"A.C.-C. Yao, Theory and applications of trapdoor functions (extended abstract), in Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (1982), pp. 80\u201391","volume-title":"Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-011-9103-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-011-9103-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-011-9103-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T05:59:58Z","timestamp":1560146398000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,12]]},"references-count":60,"journal-issue":{"published-print":{"date-parts":[[2012,7]]},"issue":"3"},"alternative-id":["9103"],"URL":"http:\/\/dx.doi.org\/10.1007\/s00145-011-9103-4","relation":{"cites":[]},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}]}}