{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:11:37Z","timestamp":1778263897494,"version":"3.51.4"},"publisher-location":"Boston, MA","reference-count":4,"publisher":"Springer US","isbn-type":[{"value":"9781441959058","type":"print"},{"value":"9781441959065","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-5906-5_157","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:52:10Z","timestamp":1319709130000},"page":"1266-1266","source":"Crossref","is-referenced-by-count":0,"title":["Strong RSA Assumption"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"157_CR1_157","series-title":"Lecture notes in computer science","first-page":"255","volume-title":"Advances in cryptology \u2013 CRYPTO 2000","author":"G Ateniese","year":"2000","unstructured":"Ateniese G, Camenisch J, Joye M, Tsudik G (2000) A practical and provably secure coalition-resistant group signature\u00a0scheme. In: Bellare M (ed) Advances in cryptology\u00a0\u2013 CRYPTO 2000. Lecture notes in computer science, vol 1880. Springer, Berlin, pp 255\u2013270"},{"key":"157_CR2_157","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Proceedings of EUROCRYPT \u201997","author":"N Baric","year":"1997","unstructured":"Baric N, Pfitzman B (1997) Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy W (ed) Proceedings of EUROCRYPT \u201997. Lecture notes in computer science, vol 1233. Springer, Berlin, pp 480\u2013494"},{"issue":"3","key":"157_CR3_157","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/357830.357847","volume":"3","author":"R Cramer","year":"2000","unstructured":"Cramer R, Shoup V (2000) Signature schemes based on the strong RSA assumption. ACM Trans Inform Syst Sec (ACM TISSEC) 3(3):161\u2013185 (Extended abstract in Proceedings of the sixth ACM conference on computer and communications security, 1999)","journal-title":"ACM Trans Inform Syst Sec (ACM TISSEC)"},{"key":"157_CR4_157","series-title":"Lecture notes in computer science","first-page":"123","volume-title":"Advances in cryptology\u00a0\u2013 EUROCRYPT\u201999","author":"R Gennaro","year":"1999","unstructured":"Gennaro R, Halevi S, Rabin T (1999) Secure hash-and-sign signatures without the random oracle. In: Stern J (ed) Advances in cryptology\u00a0\u2013 EUROCRYPT\u201999. Lecture notes in computer science, vol 1592. Springer, Berlin, pp 123\u2013139"}],"container-title":["Encyclopedia of Cryptography and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-5906-5_157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T17:51:40Z","timestamp":1778262700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_157","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}