{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:39:41Z","timestamp":1743032381537,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_53","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"674-686","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security"],"prefix":"10.1007","author":[{"given":"Shenghui","family":"Su","sequence":"first","affiliation":[]},{"given":"Shuwang","family":"L\u00fc","sequence":"additional","affiliation":[]},{"given":"Maozhi","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2011.12.011","volume":"426\u2013427","author":"S Su","year":"2012","unstructured":"Su, S., L\u00fc, S.: A Public Key Cryptosystem Based on Three New Provable Problems. Theoretical Computer Science 426\u2013427, 91\u2013117 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"53_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A Method for Obtaining Digital Signatures and Public-key Cryptosystems. Communications of the ACM 21(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"53_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-46877-3_36","volume-title":"Advances in Cryptology - EUROCRYPT 1990","author":"V Niemi","year":"1991","unstructured":"Niemi, V.: A new trapdoor in knapsacks. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 405\u2013411. Springer, Heidelberg (1991)"},{"key":"53_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0053429","volume-title":"Advances in Cryptology - EUROCRYPT 1994","author":"GA Orton","year":"1995","unstructured":"Orton, G.A.: A multiple-iterated trapdoor for dense compact knapsacks. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 112\u2013130. Springer, Heidelberg (1995)"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"Brickell, E.F.: Solving low density knapsacks. In: Advance in Cryptology: CRYPTO 1983, pp. 25\u201337. Plenum Press, New York (1984)","DOI":"10.1007\/978-1-4684-4730-9_2"},{"issue":"2","key":"53_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"MJ Coster","year":"1992","unstructured":"Coster, M.J., Joux, A., LaMacchia, B.A., et al.: Improved Low-Density Subset Sum Algorithms. Computational Complexity 2(2), 111\u2013128 (1992)","journal-title":"Computational Complexity"},{"issue":"5","key":"53_CR7","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"RC Merkle","year":"1978","unstructured":"Merkle, R.C., Hellman, M.E.: Hiding information and Signatures in Trapdoor Knapsacks. IEEE Transactions on Information Theory 24(5), 525\u2013530 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"53_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04773-6","volume-title":"Number Theory for Computing","author":"SY Yan","year":"2002","unstructured":"Yan, S.Y.: Number Theory for Computing, 2nd edn. Springer, Berlin (2002)","edition":"2"},{"key":"53_CR9","volume-title":"Algebra","author":"TW Hungerford","year":"1998","unstructured":"Hungerford, T.W.: Algebra. Springer, New York (1998)"},{"key":"53_CR10","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"2001","unstructured":"Menezes, A.J., Oorschot, P.V., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, London (2001)"},{"key":"53_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/3-540-69053-0_3","volume-title":"Advances in Cryptology - EUROCRYPT 1997","author":"D Naccache","year":"1997","unstructured":"Naccache, D., Stern, J.: A new public-key cryptosystem. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 27\u201336. Springer, Heidelberg (1997)"},{"issue":"4","key":"53_CR12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A Public-key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"53_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic Curves in Cryptography","author":"IF Blake","year":"1999","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography. Cambridge Univ. Press, Cambridge (1999)"},{"key":"53_CR14","volume-title":"The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions","author":"M Davis","year":"2004","unstructured":"Davis, M.: The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. Dover Publications, Mineola (2004)"},{"key":"53_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032916","volume-title":"Theory of Computational Complexity","author":"DZ Du","year":"2000","unstructured":"Du, D.Z., Ko, K.: Theory of Computational Complexity. John Wiley & Sons, New York (2000)"},{"key":"53_CR16","doi-asserted-by":"crossref","unstructured":"Li, T., Su, S.: Analysis of success rate of attacking knapsacks from JUNA cryptosystem by LLL lattice basis reduction. In: 9th Int. Conf. On Computational Intelligence and Security, pp. 454\u2013458. IEEE Press, New York (2013)","DOI":"10.1109\/CIS.2013.102"},{"issue":"6","key":"53_CR17","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/C-M.1977.217750","volume":"10","author":"W Diffie","year":"1977","unstructured":"Diffie, W., Hellman, M.E.: Exhaustive Cryptanalysis of the NBS Data Encryption Standard. Computer 10(6), 74\u201384 (1977)","journal-title":"Computer"},{"key":"53_CR18","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO 1998","author":"D Bleichenbacher","year":"1998","unstructured":"Bleichenbacher, D.: Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS #1. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 1\u201312. Springer, Heidelberg (1998)"},{"issue":"2","key":"53_CR19","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable Cryptography. SIAM Journal on Computing 30(2), 391\u2013437 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"53_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO 1998","author":"R Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"53_CR21","doi-asserted-by":"crossref","unstructured":"Shoup, V.: OAEP reconsidered. In: Advance in Cryptology: Crypto 2001, pp. 239\u2013259. Springer, New York (2001)","DOI":"10.1007\/3-540-44647-8_15"},{"key":"53_CR22","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: 14th Annual ACM Symposium on Theory of Computing, pp. 365\u2013377. ACM, New York (1982)","DOI":"10.1145\/800070.802212"},{"key":"53_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030423","volume-title":"Information Security","author":"M Bellare","year":"1998","unstructured":"Bellare, M.: Practice-oriented provable security. In: Okamoto, E. (ed.) ISW 1997. LNCS, vol. 1396. Springer, Heidelberg (1998)"},{"key":"53_CR24","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Computer and System Sciences 28, 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"53_CR25","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010756","volume-title":"Introduction to Modern Cryptography: Principles and Protocols","author":"J Katz","year":"2007","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography: Principles and Protocols. Chapman & Hall \/ CRC, Boca Raton (2007)"},{"key":"53_CR26","unstructured":"Su, S., L\u00fc, S.: REESSE1+. Reward. Proof by Experiment. A New Approach to Proof of P != NP. Cornell University Library (2009). http:\/\/arxiv.org\/pdf\/0908.0482 (revised 2014)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T18:32:40Z","timestamp":1674239560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}