{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T17:15:13Z","timestamp":1791393313517,"version":"4.3.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540205920","type":"print"},{"value":"9783540400615","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40061-5_3","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:06:00Z","timestamp":1283713560000},"page":"37-54","source":"Crossref","is-referenced-by-count":231,"title":["A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Bresson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dario","family":"Catalano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Pointcheval","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Benaloh, J.: Verifiable Secret-Ballot Elections. PhD Thesis, Yale University (1987)"},{"key":"3_CR2","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)"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00204448","volume":"2","author":"J.F. Boyar","year":"1990","unstructured":"Boyar, J.F., Kurtz, S.A., Krentel, M.W.: A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs. Journal of Cryptology\u00a02(2), 63\u201376 (1990)","journal-title":"Journal of Cryptology"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum Disclosure Proofs of Knowledge. Journal of Computer and System Sciences\u00a037 (1988)","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"3_CR5","first-page":"206","volume-title":"Proc. of the 8th CCS","author":"D. Catalano","year":"2001","unstructured":"Catalano, D., Gennaro, R., Howgrave-Graham, N., Nguyen, P.Q.: Paillier\u2019s Cryptosystem Revisited. In: Proc. of the 8th CCS, pp. 206\u2013214. ACM Press, New York (2001)"},{"key":"3_CR6","volume-title":"Proc. of the 26th FOCS","author":"J. Cohen","year":"1985","unstructured":"Cohen, J., Fisher, M.: A robust and Verifiable cryptographically secure election scheme. In: Proc. of the 26th FOCS. IEEE, Los Alamitos (1985)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 45\u201364. Springer, Heidelberg (2002)"},{"issue":"4","key":"3_CR8","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT\u201331","author":"T. Gamal El","year":"1985","unstructured":"El Gamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory\u00a0IT\u201331(4), 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/0-387-34805-0_24","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"S. Even","year":"1990","unstructured":"Even, S., Goldreich, O., Micali, S.: On-line\/Off-line Digital Signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 263\u2013275. Springer, Heidelberg (1990)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/3-540-36178-2_34","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"C. Gentry","year":"2002","unstructured":"Gentry, C., Silverberg, A.: Hierarchical ID-Based Encryption. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 548\u2013566. Springer, Heidelberg (2002)"},{"key":"3_CR11","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\u00a028, 270\u2013299 (1984)","journal-title":"System Sciences"},{"key":"3_CR12","first-page":"291","volume-title":"Proc. of the 17th STOC","author":"S. Goldwasser","year":"1985","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. In: Proc. of the 17th STOC, pp. 291\u2013304. ACM Press, New York (1985)"},{"key":"3_CR13","first-page":"441","volume-title":"Proc. of the 25th FOCS","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S., Rivest, R.: A \u201cParadoxical\u201d Solution to the Signature Problem. In: Proc. of the 25th FOCS, pp. 441\u2013448. IEEE, New York (1984)"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal of Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM Journal of Computing"},{"key":"3_CR15","unstructured":"Joux, A., Guyen, K.N.: Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. Cryptology eprint archive (2001), http:\/\/eprint.iacr.org\/2001\/003\/"},{"key":"3_CR16","unstructured":"Krawczyk, H., Rabin, T.: Chameleon Hashing and Signatures. In: Proc. of NDSS 2000. Internet Society (2000)"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","volume":"13","author":"G. Miller","year":"1976","unstructured":"Miller, G.: Riemann\u2019s Hypothesis and Tests for Primality. Journal of Computer and System Sciences\u00a013, 300\u2013317 (1976)","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR18","volume-title":"Proc. of 5th Symposium on Computer and Communications Security","author":"D. Naccache","year":"1998","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: Proc. of 5th Symposium on Computer and Communications Security. ACM, New York (1998)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45353-9_13","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"T. Okamoto","year":"2001","unstructured":"Okamoto, T., Pointcheval, D.: REACT: Rapid Enhanced-security Asymmetric Cryptosystem Transform. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 159\u2013175. Springer, Heidelberg (2001)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_8","volume-title":"Public Key Cryptography","author":"T. Okamoto","year":"2001","unstructured":"Okamoto, T., Uchiyama, S.: The Gap-Problems: A new class of problems for the security of cryptographic schemes. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992. Springer, Heidelberg (2001)"},{"key":"3_CR21","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 Discrete Logarithms Residues. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"issue":"2","key":"3_CR22","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":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-44647-8_21","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. Shamir","year":"2001","unstructured":"Shamir, A., Taumann, Y.: Improved On-line\/Off-line Signature Schemes. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 355\u2013367. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40061-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T17:19:35Z","timestamp":1559582375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40061-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205920","9783540400615"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40061-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}