{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T02:53:36Z","timestamp":1696560816496},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2004,2]]},"abstract":"\n This paper presents a new simple schemes for verifiable encryption of digital signatures. We make use of a trusted third party (TTP) but in an\n optimistic<\/jats:italic>\n sense, that is, the TTP takes part in the protocol only if one user cheats or simply crashes. Our schemes can be used as primitives to build efficient fair exchange and certified e-mail protocols.\n <\/jats:p>","DOI":"10.1145\/984334.984335","type":"journal-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T16:39:33Z","timestamp":1090341573000},"page":"1-20","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":57,"title":["Verifiable encryption of digital signatures and applications"],"prefix":"10.1145","volume":"7","author":[{"given":"Giuseppe","family":"Ateniese","sequence":"first","affiliation":[{"name":"The Johns Hopkins University, Baltimore, MD"}]}],"member":"320","published-online":{"date-parts":[[2004,2]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Fourth ACM Conference on Computer and Communication Security. ACM Press, 8--17","author":"Asokan N.","unstructured":"Asokan , N. , Schunter , M. , and Waidner , M . 1997. Optimistic protocols for fair exchange . In Fourth ACM Conference on Computer and Communication Security. ACM Press, 8--17 .]] 10.1145\/266420.266426 Asokan, N., Schunter, M., and Waidner, M. 1997. Optimistic protocols for fair exchange. In Fourth ACM Conference on Computer and Communication Security. ACM Press, 8--17.]] 10.1145\/266420.266426"},{"key":"e_1_2_1_2_1","volume-title":"IEEE Symposium on Security and Privacy","author":"Asokan N.","unstructured":"Asokan , N. , Shoup , V. , and Waidner , M . 1998a. Asynchronous protocols for optimistic fair exchange . In IEEE Symposium on Security and Privacy ( Oakland, CA).]] Asokan, N., Shoup, V., and Waidner, M. 1998a. Asynchronous protocols for optimistic fair exchange. In IEEE Symposium on Security and Privacy (Oakland, CA).]]"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/49.839935","article-title":"Optimistic fair exchange of digital signatures","volume":"18","author":"Asokan N.","year":"1998","unstructured":"Asokan , N. , Shoup , V. , and Waidner , M. 1998 b. Optimistic fair exchange of digital signatures . IEEE Journal on Selected Areas in Communications 18 , 4, 593 -- 610 , 2000. Extended abstract in Advances in Cryptology---EUROCRYPT'98. Lecture Notes in Computer Science, vol. 1403. Springer-Verlag, Berlin, 591--606.]] Asokan, N., Shoup, V., and Waidner, M. 1998b. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications 18, 4, 593--610, 2000. Extended abstract in Advances in Cryptology---EUROCRYPT'98. Lecture Notes in Computer Science, vol. 1403. Springer-Verlag, Berlin, 591--606.]]","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"e_1_2_1_4_1","volume-title":"Sixth ACM Conference on Computer and Communications Security (ACM CCS'99)","author":"Ateniese G.","year":"1999","unstructured":"Ateniese , G. 1999 . Efficient verifiable encryption (and fair exchange) of digital signatures . In Sixth ACM Conference on Computer and Communications Security (ACM CCS'99) . Also appeared as IBM Research Report.]] 10.1145\/3 19709.319728 Ateniese, G. 1999. Efficient verifiable encryption (and fair exchange) of digital signatures. In Sixth ACM Conference on Computer and Communications Security (ACM CCS'99). Also appeared as IBM Research Report.]] 10.1145\/319709.319728"},{"key":"e_1_2_1_5_1","volume-title":"ISOC 2001 Network and Distributed System Security Symposium (NDSS'01)","author":"Ateniese G.","unstructured":"Ateniese , G. , de Medeiros , B. , and Goodrich , M. T . 2001. TRICERT: distributed certified e-mail schemes . In ISOC 2001 Network and Distributed System Security Symposium (NDSS'01) (San Diego, CA, USA).]] Ateniese, G., de Medeiros, B., and Goodrich, M. T. 2001. TRICERT: distributed certified e-mail schemes. In ISOC 2001 Network and Distributed System Security Symposium (NDSS'01) (San Diego, CA, USA).]]"},{"key":"e_1_2_1_6_1","volume-title":"RSA 2002, McEnery Convention Center","author":"Ateniese G.","unstructured":"Ateniese , G. and Nita-Rotaru , C . 2002. Stateless-recipient certified e-mail system based on verifiable encryption . In RSA 2002, McEnery Convention Center ( San Jose, CA, USA, Feb. 19--22).]] Ateniese, G. and Nita-Rotaru, C. 2002. Stateless-recipient certified e-mail system based on verifiable encryption. In RSA 2002, McEnery Convention Center (San Jose, CA, USA, Feb. 19--22).]]"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of Symposium on Network and Distributed Systems Security (Feb.","author":"Bahreman A.","year":"1994","unstructured":"Bahreman A. and Tygar , J. D . 1994. Certified electronic mail . In Proceedings of Symposium on Network and Distributed Systems Security (Feb. 1994 ). I. Society, 3--19.]] Bahreman A. and Tygar, J. D. 1994. Certified electronic mail. In Proceedings of Symposium on Network and Distributed Systems Security (Feb. 1994). I. Society, 3--19.]]"},{"key":"e_1_2_1_8_1","volume-title":"IEEE Symposium on Security and Privacy","author":"Bao F.","year":"1998","unstructured":"Bao , F. , Deng , R. H. , and Mao . W. 1998 . Efficient and practical fair exchange protocols with off-line TTP . In IEEE Symposium on Security and Privacy ( Oakland, CA).]] Bao, F., Deng, R. H., and Mao. W. 1998. Efficient and practical fair exchange protocols with off-line TTP. In IEEE Symposium on Security and Privacy (Oakland, CA).]]"},{"key":"e_1_2_1_9_1","volume-title":"First ACM Conference on Computer and Communication Security. ACM Press, 62--73","author":"Bellare M.","unstructured":"Bellare , M. and Rogaway , P . 1993. Random oracles are practical: A paradigm for designing efficient protocols . In First ACM Conference on Computer and Communication Security. ACM Press, 62--73 .]] 10.1145\/168588.168596 Bellare, M. and Rogaway, P. 1993. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communication Security. ACM Press, 62--73.]] 10.1145\/168588.168596"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/18.50372","article-title":"A fair protocol for signing contracts","volume":"1","author":"Ben-Or M.","year":"1990","unstructured":"Ben-Or , M. , Goldreich , O. , Micali , S. , and Rivest , R. 1990 . A fair protocol for signing contracts . IEEE Transactions on Information Theory IT-36 , 1 , 40 -- 46 .]] Ben-Or, M., Goldreich, O., Micali, S., and Rivest, R. 1990. A fair protocol for signing contracts. IEEE Transactions on Information Theory IT-36, 1, 40--46.]]","journal-title":"IEEE Transactions on Information Theory IT-36"},{"key":"e_1_2_1_11_1","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithmic Number Theory (ANTS-III)","author":"Boneh D.","unstructured":"Boneh , D. 1998. The decision Diffie-Hellman problem . In Algorithmic Number Theory (ANTS-III) . Lecture Notes in Computer Science , vol. 1423 . Springer-Verlag , Berlin , 48--63.]] Boneh, D. 1998. The decision Diffie-Hellman problem. In Algorithmic Number Theory (ANTS-III). Lecture Notes in Computer Science, vol. 1423. Springer-Verlag, Berlin, 48--63.]]"},{"key":"e_1_2_1_12_1","volume-title":"Lecture Notes in Computer Science","volume":"1976","author":"Camenisch J.","unstructured":"Camenisch , J. and Damgard , I. B . 2000. Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In Advances in Cryptology---ASIACRYPT'00 . Lecture Notes in Computer Science , vol. 1976 . Springer-Verlag, Berlin, 331--345.]] Camenisch, J. and Damgard, I. B. 2000. Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In Advances in Cryptology---ASIACRYPT'00. Lecture Notes in Computer Science, vol. 1976. Springer-Verlag, Berlin, 331--345.]]"},{"key":"e_1_2_1_13_1","volume-title":"Lecture Notes in Computer Science","volume":"1514","author":"Camenisch J.","unstructured":"Camenisch , J. and Michels , M . 1998a. A group signature scheme with improved efficiency. In Advances in Cryptology---ASIACRYPT'98 . Lecture Notes in Computer Science , vol. 1514 . Springer-Verlag, Berlin, 160--174.]] Camenisch, J. and Michels, M. 1998a. A group signature scheme with improved efficiency. In Advances in Cryptology---ASIACRYPT'98. Lecture Notes in Computer Science, vol. 1514. Springer-Verlag, Berlin, 160--174.]]"},{"key":"e_1_2_1_14_1","volume-title":"Technical Report RS-98-27, BRICS, Aarhus. An earlier version appears in Camenisch and Michels {1998}.]]","author":"Camenisch J.","year":"1998","unstructured":"Camenisch , J. and Michels , M . 1998 b. A Group Signature Scheme Based on an RSA-Variant. Technical Report RS-98-27, BRICS, Aarhus. An earlier version appears in Camenisch and Michels {1998}.]] Camenisch, J. and Michels, M. 1998b. A Group Signature Scheme Based on an RSA-Variant. Technical Report RS-98-27, BRICS, Aarhus. An earlier version appears in Camenisch and Michels {1998}.]]"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Camenisch J. and Michels M. 1999a. Proving in zero-knowledge that a number is the product of two safe primes. In Advances in Cryptology---EUROCRYPT'99. Lecture Notes in Computer Science. Springer-Verlag Berlin.]] Camenisch J. and Michels M. 1999a. Proving in zero-knowledge that a number is the product of two safe primes. In Advances in Cryptology---EUROCRYPT'99. Lecture Notes in Computer Science. Springer-Verlag Berlin.]]","DOI":"10.1007\/3-540-48910-X_8"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Camenisch J. and Michels M. 1999b. Separability and efficiency for generic group signature schemes. In Advances in Cryptology---Crypto'99.]] Camenisch J. and Michels M. 1999b. Separability and efficiency for generic group signature schemes. In Advances in Cryptology---Crypto'99.]]","DOI":"10.1007\/3-540-48405-1_27"},{"key":"e_1_2_1_17_1","volume-title":"Lecture Notes in Computer Science","volume":"1403","author":"Chan A.","unstructured":"Chan , A. , Frankel , Y. , and Tsiounis , Y . 1998. Easy come---easy go divisible cash. In Advances in Cryptology---EUROCRYPT'98 . Lecture Notes in Computer Science , vol. 1403 . Springer-Verlag, Berlin, 561--575. Updated and corrected version available as GTE Technical Report.]] Chan, A., Frankel, Y., and Tsiounis, Y. 1998. Easy come---easy go divisible cash. In Advances in Cryptology---EUROCRYPT'98. Lecture Notes in Computer Science, vol. 1403. Springer-Verlag, Berlin, 561--575. Updated and corrected version available as GTE Technical Report.]]"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Chaum D. and Pedersen T. 1992. Wallet databases with observers. In Advances in Cryptology---Crypto'92 89--105.]] Chaum D. and Pedersen T. 1992. Wallet databases with observers. In Advances in Cryptology---Crypto'92 89--105.]]","DOI":"10.1007\/3-540-48071-4_7"},{"key":"e_1_2_1_19_1","volume-title":"Sixth ACM Conference on Computer and Communication Security. ACM Press.]] 10","author":"Cramer R.","year":"1970","unstructured":"Cramer , R. and Shoup , V . 1999. Signature schemes based on the strong RSA assumption . In Sixth ACM Conference on Computer and Communication Security. ACM Press.]] 10 .1145\/3 1970 9.319716 Cramer, R. and Shoup, V. 1999. Signature schemes based on the strong RSA assumption. In Sixth ACM Conference on Computer and Communication Security. ACM Press.]] 10.1145\/319709.319716"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02139147","article-title":"Practical protocols for certified electronic e-mail","volume":"4","author":"Deng R. H.","year":"1996","unstructured":"Deng , R. H. , Gong , L. , Lazar , A. , and Wang , W. 1996 . Practical protocols for certified electronic e-mail . Journal of Networks and Systems Management 4 , 3, 279 -- 297 .]] Deng, R. H., Gong, L., Lazar, A., and Wang, W. 1996. Practical protocols for certified electronic e-mail. Journal of Networks and Systems Management 4, 3, 279--297.]]","journal-title":"Journal of Networks and Systems Management"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_2_1_22_1","volume-title":"Lecture Notes in Computer Science","volume":"263","author":"Fiat A.","unstructured":"Fiat , A. and Shamir , A . 1987. How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology---CRYPTO'86 . Lecture Notes in Computer Science , vol. 263 . Springer-Verlag, Berlin, 186--194.]] Fiat, A. and Shamir, A. 1987. How to prove yourself: practical solutions to identification and signature problems. In Advances in Cryptology---CRYPTO'86. Lecture Notes in Computer Science, vol. 263. Springer-Verlag, Berlin, 186--194.]]"},{"key":"e_1_2_1_23_1","volume-title":"Advances in Cryptology---CRYPTO '97","volume":"1294","author":"Fujisaki E.","unstructured":"Fujisaki , E. and Okamoto , T . 1997. Statistical zero knowledge protocols to prove modular polynomial relations . In Advances in Cryptology---CRYPTO '97 . Lecture Notes in Computer Science , vol. 1294 . Springer-Verlag, Berlin, 16--30.]] Fujisaki, E. and Okamoto, T. 1997. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology---CRYPTO '97. Lecture Notes in Computer Science, vol. 1294. Springer-Verlag, Berlin, 16--30.]]"},{"key":"e_1_2_1_24_1","volume-title":"Lecture Notes in Computer Science","volume":"1592","author":"Gennaro R.","unstructured":"Gennaro , R. , Halevi , S. , and Rabin , T . 1999. Secure signatures, without trees or random oracles. In Advances in Cryptology---EUROCRYPT'99 . Lecture Notes in Computer Science , vol. 1592 . Springer-Verlag, Berlin, 123--139.]] Gennaro, R., Halevi, S., and Rabin, T. 1999. Secure signatures, without trees or random oracles. In Advances in Cryptology---EUROCRYPT'99. Lecture Notes in Computer Science, vol. 1592. Springer-Verlag, Berlin, 123--139.]]"},{"key":"e_1_2_1_25_1","volume-title":"Lecture Notes in Computer Science","volume":"403","author":"Guillou L. C.","unstructured":"Guillou , L. C. and Quisquater , J. J . 1988. A paradoxical identity-based signature scheme resulting from zero-knowledge. In Advances in Cryptology---CRYPTO'88 . Lecture Notes in Computer Science , vol. 403 . Springer-Verlag, Berlin, 216--231.]] Guillou, L. C. and Quisquater, J. J. 1988. A paradoxical identity-based signature scheme resulting from zero-knowledge. In Advances in Cryptology---CRYPTO'88. Lecture Notes in Computer Science, vol. 403. Springer-Verlag, Berlin, 216--231.]]"},{"key":"e_1_2_1_26_1","unstructured":"Menezes A. J. van Oorschot P. C. and Vanstone S. A. 1996. Handbook of Applied Cryptography. CRC Press Boco Raton FL (ISBN 0-8493-8523-7).]] Menezes A. J. van Oorschot P. C. and Vanstone S. A. 1996. Handbook of Applied Cryptography. CRC Press Boco Raton FL (ISBN 0-8493-8523-7).]]"},{"key":"e_1_2_1_27_1","volume-title":"1997 RSA Security Conference.]]","author":"Micali S.","year":"1997","unstructured":"Micali , S. 1997 . Certified e-mail with invisible post offices . Presented at the 1997 RSA Security Conference.]] Micali, S. 1997. Certified e-mail with invisible post offices. Presented at the 1997 RSA Security Conference.]]"},{"key":"e_1_2_1_28_1","volume-title":"Fifth ACM Conference on Computer and Communications Security. ACM Press, 59--66","author":"Naccache D.","unstructured":"Naccache , D. and Stern , J . 1998. A new public key cryptosystem based on higher residues . In Fifth ACM Conference on Computer and Communications Security. ACM Press, 59--66 .]] 10.1145\/288090.288106 Naccache, D. and Stern, J. 1998. A new public key cryptosystem based on higher residues. In Fifth ACM Conference on Computer and Communications Security. ACM Press, 59--66.]] 10.1145\/288090.288106"},{"key":"e_1_2_1_29_1","volume-title":"Lecture Notes in Computer Science","volume":"1403","author":"Okamoto T.","unstructured":"Okamoto , T. and Uchiyama , S . 1998. A new public-key cryptosystem as secure as factoring. In Advances in Cryptology----EUROCRYPT'98 . Lecture Notes in Computer Science , vol. 1403 . Springer-Verlag, Berlin, 308--318.]] Okamoto, T. and Uchiyama, S. 1998. A new public-key cryptosystem as secure as factoring. In Advances in Cryptology----EUROCRYPT'98. Lecture Notes in Computer Science, vol. 1403. Springer-Verlag, Berlin, 308--318.]]"},{"key":"e_1_2_1_30_1","volume-title":"Lecture Notes in Computer Science","volume":"1403","author":"Poupard G.","unstructured":"Poupard , G. and Stern , J . 1998. Security analysis of a practical \"on the fly\" authentication and signature generation. In Advances in Cryptology---EUROCRYPT'98 . Lecture Notes in Computer Science , vol. 1403 . Springer-Verlag, Berlin, 422--436.]] Poupard, G. and Stern, J. 1998. Security analysis of a practical \"on the fly\" authentication and signature generation. In Advances in Cryptology---EUROCRYPT'98. Lecture Notes in Computer Science, vol. 1403. Springer-Verlag, Berlin, 422--436.]]"},{"key":"e_1_2_1_31_1","volume-title":"Thirteenth Annual Computer Security Applications Conference (Dec.), 100--106","author":"Riordan J.","unstructured":"Riordan , J. and Schneier , B . 1998. A certified e-mail protocol . In Thirteenth Annual Computer Security Applications Conference (Dec.), 100--106 .]] Riordan, J. and Schneier, B. 1998. A certified e-mail protocol. In Thirteenth Annual Computer Security Applications Conference (Dec.), 100--106.]]"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","article-title":"Efficient signature generation by smart-cards","volume":"4","author":"Schnorr C. P.","year":"1991","unstructured":"Schnorr , C. P. 1991 . Efficient signature generation by smart-cards . Journal of Cryptology 4 , 3, 161 -- 174 .]] Schnorr, C. P. 1991. Efficient signature generation by smart-cards. Journal of Cryptology 4, 3, 161--174.]]","journal-title":"Journal of Cryptology"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of Computer Security---ESORICS'96","author":"Zhou J.","unstructured":"Zhou , J. and Gollmann , D . 1996. Certified electronic mail . In Proceedings of Computer Security---ESORICS'96 . Springer-Verlag, Berlin, 55--61.]] Zhou, J. and Gollmann, D. 1996. Certified electronic mail. In Proceedings of Computer Security---ESORICS'96. Springer-Verlag, Berlin, 55--61.]]"}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/984334.984335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T09:35:45Z","timestamp":1672738545000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/984334.984335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["10.1145\/984334.984335"],"URL":"http:\/\/dx.doi.org\/10.1145\/984334.984335","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"value":"1094-9224","type":"print"},{"value":"1557-7406","type":"electronic"}],"subject":["Safety, Risk, Reliability and Quality","General Computer Science"],"published":{"date-parts":[[2004,2]]},"assertion":[{"value":"2004-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}