{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T07:04:45Z","timestamp":1750316685414},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540289388"},{"type":"electronic","value":"9783540320661"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11554868_15","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:49:02Z","timestamp":1127832542000},"page":"210-221","source":"Crossref","is-referenced-by-count":5,"title":["Questionable Encryption and Its Applications"],"prefix":"10.1007","author":[{"given":"Adam","family":"Young","sequence":"first","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"Algorithmic Number Theory: Efficient Algorithms - Solving Equations over Finite Fields, ch.\u00a07","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory: Efficient Algorithms - Solving Equations over Finite Fields, ch.\u00a07, vol.\u00a0I. MIT Press, Cambridge (1996)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-39568-7_23","volume-title":"Advances in Cryptology","author":"M. Blum","year":"1985","unstructured":"Blum, M., Goldwasser, S.: An efficient probabilistic public-key encryption scheme which hides all partial information. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 289\u2013302. Springer, Heidelberg (1985)"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM Journal on Computing\u00a015(2), 364\u2013383 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","first-page":"234","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"G. Brassard","year":"1987","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.M.: All-or-nothing disclosure of secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 234\u2013238. Springer, Heidelberg (1987)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.M.: Information Theoretic Reductions among Disclosure Problems. In: IEEE Symposium on Foundations of Computer Science, pp. 168\u2013173 (1986)","DOI":"10.1109\/SFCS.1986.26"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-39757-4_26","volume-title":"Advances in Cryptology","author":"R. Berger","year":"1985","unstructured":"Berger, R., Peralta, R., Tedrick, T.: A Provably Secure Oblivious Transfer Protocol. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol.\u00a0209, pp. 379\u2013386. Springer, Heidelberg (1985)"},{"key":"15_CR7","unstructured":"Blum, M.: Three applications of the oblivious transfer: Part I: Coin flipping by telephone; Part II: How to exchange secrets; Part III: How to send certified electronic mail. UC Berkeley (1981)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D. Boneh","year":"1998","unstructured":"Boneh, D.: The Decision Diffie-Hellman Problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 48\u201363. Springer, Heidelberg (1998)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C. Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally Private Information Retrieval with Polylogarithmic Communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 402\u2013414. Springer, Heidelberg (1999)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/BFb0052229","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"R. Canetti","year":"1997","unstructured":"Canetti, R., Dwork, C., Naor, M., Ostrovsky, R.: Deniable Encryption. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 90\u2013104. Springer, Heidelberg (1997)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","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.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. Gamal El","year":"1985","unstructured":"El Gamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. Inform. Theory\u00a031, 469\u2013472 (1985)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"15_CR13","unstructured":"Goldwasser, S., Bellare, M.: Lecture Notes on Cryptography (manuscript) (July 10, 1996)"},{"issue":"2","key":"15_CR14","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. JCSS\u00a028(2), 270\u2013299 (1984)","journal-title":"JCSS"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: ACM STOC, pp.\u00a020\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"15_CR16","volume-title":"Uses of randomness in algorithms and protocols","author":"J. Kilian","year":"1990","unstructured":"Kilian, J.: Uses of randomness in algorithms and protocols. MIT Press, Cambridge (1990)"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval. IEEE Foundations of Computer Science, 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"15_CR18","unstructured":"PKCS #1-RSA Cryptography Standard, version 2.1, available from http:\/\/www.rsa.com\/rsalabs\/pkcs"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-Key Cryptosystems based on Composite Degree Residue Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"15_CR20","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Harvard Aiken Comp. Lab., TR-81 (1981)"},{"issue":"2","key":"15_CR21","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BFb0054019","volume-title":"Public Key Cryptography","author":"Y. Tsiounis","year":"1998","unstructured":"Tsiounis, Y., Yung, M.: On the security of ElGamal-based encryption. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 117\u2013134. Springer, Heidelberg (1998)"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Young, A., Yung, M.: Deniable Password Snatching: On the Possibility of Evasive Electronic Espionage. In: IEEE Symposium on Security and Privacy, pp. 224\u2013235 (1997)","DOI":"10.1109\/SECPRI.1997.601339"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 Mycrypt 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11554868_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:46:58Z","timestamp":1605642418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11554868_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540289388","9783540320661"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11554868_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}