{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:29:39Z","timestamp":1725467379908},"publisher-location":"Boston, MA","reference-count":8,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387311715"},{"type":"electronic","value":"9780387311739"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/0-387-31173-4_36","type":"book-chapter","created":{"date-parts":[[2006,7,6]],"date-time":"2006-07-06T07:46:35Z","timestamp":1152171995000},"page":"331-335","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Proactive RSA Scheme for Large-Scale Ad Hoc Networks"],"prefix":"10.1007","author":[{"given":"Ruishan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Kefei","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proc. 10th ACM Symposium on Principles of Distributed Computing (PODC), pages 51\u201359, 1991.","DOI":"10.1145\/112600.112605"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing or how to cope with perpetual leakage. In Advances in Cryptology CRYPTO\u2019 95 (D. Coppersmith, ed. Springer.). 963:339\u2013352, 1995","DOI":"10.1007\/3-540-44750-4_27"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Danny Dolev and H. Raymond Strong. Authenticated algorithms for byzantine agreement. SIAM J. Computing, 12(4), 1983.","DOI":"10.1137\/0212045"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmell, P. D. MacKenzie, and M. Yung. Optimal-Resilience Proactive Public-Key Cryptosystems. In Foundations of Computer Science FOCS\u201997, pages 384\u2013393, 1997.","DOI":"10.1109\/SFCS.1997.646127"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Y. Frankel, P. Gemmell, P. D. MacKenzie, and M. Yung. Proactive RSA. In Proc. of Crypto\u201997, pages 440\u2013454, 1997.","DOI":"10.1007\/BFb0052254"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"T. Rabin. A simplified approach to threshold and proactive RSA. in Proc. CRYPTO\u2019 98, pp. 89\u2013104, Springer, 1998.","DOI":"10.1007\/BFb0055722"},{"issue":"6","key":"36_CR7","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1109\/TNET.2004.838598","volume":"12","author":"H. Luo","year":"2004","unstructured":"Haiyun Luo, Jiejun Kong, Petros Zerfos, Songwu Lu, and Lixia Zhang. URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks, IEEE\/ACM Transactions on Networking (ToN), pp. 1049\u20131063, 12(6), 2004.","journal-title":"IEEE\/ACM Transactions on Networking (ToN)"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Stanislaw Jarecki, Nitesh Saxena, and Jeong Hyun Yi. Cryptanalyzing the Proactive RSA Signature Scheme in the URSA Ad Hoc Network Access Control Protocol. In ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN), October 2004.","DOI":"10.1145\/1029102.1029105"}],"container-title":["IFIP International Federation for Information Processing","Challenges in Ad Hoc Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-31173-4_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T17:17:22Z","timestamp":1555694242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-31173-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780387311715","9780387311739"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/0-387-31173-4_36","relation":{},"ISSN":["1571-5736"],"issn-type":[{"type":"print","value":"1571-5736"}],"subject":[],"published":{"date-parts":[[2006]]}}}