{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:44Z","timestamp":1725549524132},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540239758"},{"type":"electronic","value":"9783540305392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30539-2_25","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:41:57Z","timestamp":1268401317000},"page":"354-371","source":"Crossref","is-referenced-by-count":22,"title":["Generic Homomorphic Undeniable Signatures"],"prefix":"10.1007","author":[{"given":"Jean","family":"Monnerat","sequence":"first","affiliation":[]},{"given":"Serge","family":"Vaudenay","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-61996-8_38","volume-title":"Information Hiding","author":"R. Anderson","year":"1996","unstructured":"Anderson, R., Vaudenay, S., Preneel, B., Nyberg, K.: The Newton Channel. In: Anderson, R. (ed.) IH 1996. LNCS, vol.\u00a01174, pp. 151\u2013156. Springer, Heidelberg (1996)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof Verification and Hardness of Approximation Problems. In: Proc. 33rd IEEE Symp. on Foundations of Computer Science, pp. 14\u201323 (1992)","DOI":"10.1109\/SFCS.1992.267823"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Levin, L., Szegedy, M.: Checking Computations in Polylogarithmic Time. In: Proc. 23rd ACM Symp. on Theory of Computing, pp. 21\u201331 (1991)","DOI":"10.1145\/103418.103428"},{"key":"25_CR4","unstructured":"Biehl, I., Paulus, S., Takagi, T.: Efficient Undeniable Signature Schemes based on Ideal Arithmetic in Quadratic Orders. In: Conference on The Mathematics of Public-Key Cryptography, Toronto (1999)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-38424-3_14","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"J. Boyar","year":"1991","unstructured":"Boyar, J., Chaum, D., Damg\u00e5rd, I., Pedersen, T.: Convertible Undeniable Signatures. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 189\u2013205. Springer, Heidelberg (1991)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-40061-5_3","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"E. Bresson","year":"2003","unstructured":"Bresson, E., Catalano, D., Pointcheval, D.: A Simple Public-Key Cryptosytem with a Double Trapdoor Decryption Mechanism and Its applications. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 37\u201354. Springer, Heidelberg (2003)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/3-540-46877-3_41","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"D. Chaum","year":"1991","unstructured":"Chaum, D.: Zero-Knowledge Undeniable Signatures. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 458\u2013464. Springer, Heidelberg (1991)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BFb0053427","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"D. Chaum","year":"1995","unstructured":"Chaum, D.: Designated Confirmer Signatures. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 86\u201391. Springer, Heidelberg (1995)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/0-387-34805-0_20","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., van Antwerpen, H.: Undeniable Signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 212\u2013217. Springer, Heidelberg (1990)"},{"key":"25_CR10","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. McGraw Hill, New York (1990)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/3-540-68339-9_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"I. D\u00e5mgard","year":"1996","unstructured":"D\u00e5mgard, I., Pedersen, T.: New Convertible Undeniable Signatures Schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 372\u2013386. Springer, Heidelberg (1996)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/3-540-46416-6_19","volume-title":"Advances in Cryptology - Crypto 1991","author":"Y. Desmedt","year":"1991","unstructured":"Desmedt, Y., Yung, M.: Weaknesses of Undeniable Signature Schemes. In: CRYPTO 1991. LNCS, vol.\u00a0576, pp. 205\u2013220. Springer, Heidelberg (1991)"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory\u00a0IT-22, 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s001450010001","volume":"13","author":"R. Gennaro","year":"2000","unstructured":"Gennaro, R., Rabin, T., Krawczyk, H.: RSA-Based Undeniable Signatures. Journal of Cryptology\u00a013, 397\u2013416 (2000)","journal-title":"Journal of Cryptology"},{"key":"25_CR16","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":"Journal of Computer and System Sciences"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Jakobsson","year":"1996","unstructured":"Jakobsson, M., Sako, K., Impagliazzo, R.: Designated Verifier Proofs and Their Applications. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 143\u2013154. Springer, Heidelberg (1996)"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-24660-2_9","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"B. Libert","year":"2004","unstructured":"Libert, B., Quisquater, J.-J.: Identity Based Undeniable Signatures. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 112\u2013125. Springer, Heidelberg (2004)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-24632-9_6","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"J. Monnerat","year":"2004","unstructured":"Monnerat, J., Vaudenay, S.: Undeniable Signatures Based on Characters: How to Sign with One Bit. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 69\u201385. Springer, Heidelberg (2004)"},{"key":"25_CR20","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 Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A Method for Obtaining Digital Signatures and Public-key Cryptosystem. Communications of the ACM\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30539-2_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:59:08Z","timestamp":1605761948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30539-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239758","9783540305392"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30539-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}