{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:15:46Z","timestamp":1725747346621},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642411564"},{"type":"electronic","value":"9783642411571"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41157-1_1","type":"book-chapter","created":{"date-parts":[[2013,9,4]],"date-time":"2013-09-04T10:23:39Z","timestamp":1378290219000},"page":"1-18","source":"Crossref","is-referenced-by-count":0,"title":["From Rational Number Reconstruction to Set Reconciliation and File Synchronization"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Amarilli","sequence":"first","affiliation":[]},{"given":"Fabrice","family":"Ben Hamouda","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Bourse","sequence":"additional","affiliation":[]},{"given":"Robin","family":"Morisset","sequence":"additional","affiliation":[]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[]},{"given":"Pablo","family":"Rauzy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"https:\/\/github.com\/RobinMorisset\/Btrsync","key":"1_CR1"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-36362-7_19","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"M. Abdalla","year":"2013","unstructured":"Abdalla, M., Ben Hamouda, F., Pointcheval, D.: Tighter Reductions for Forward-Secure Signature Schemes. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol.\u00a07778, pp. 292\u2013311. Springer, Heidelberg (2013)"},{"unstructured":"Amarilli, A., Ben Hamouda, F., Bourse, F., Morisset, R., Naccache, D., Rauzy, P.: From Rational Number Reconstruction to Set Reconciliation and File Synchronization. Full version available from the authors\u2019 webpage","key":"1_CR3"},{"unstructured":"Burnikel, C., Ziegler, J., Stadtwald, I.: Fast Recursive Division, Tech. Rep., MPI-I-98-1-022, MPI Informatik Saarbrucken (1998)","key":"1_CR4"},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/964725.633031","volume":"32","author":"J. Byers","year":"2002","unstructured":"Byers, J., Considine, J., Mitzenmacher, M., Rost, S.: Informed Content Delivery Across Adaptive Overlay Networks. ACM SIGCOMM Computer Communication Review\u00a032(4), 47\u201360 (2002)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-45539-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"J.-S. Coron","year":"2000","unstructured":"Coron, J.-S., Naccache, D.: Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 91\u2013101. Springer, Heidelberg (2000)"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/2043164.2018462","volume":"41","author":"D. Eppstein","year":"2011","unstructured":"Eppstein, D., Goodrich, M., Uyeda, F., Varghese, G.: What\u2019s the Difference?: Efficient Set Reconciliation Without Prior Context. ACM SIGCOMM Computer Communication Review\u00a041, 218\u2013229 (2011)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-36504-4_10","volume-title":"Financial Cryptography","author":"P.A. Fouque","year":"2003","unstructured":"Fouque, P.A., Stern, J., Wackers, J.G.: Cryptocomputing With Rationals. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 136\u2013146. Springer, Heidelberg (2003)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-642-03356-8_38","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"S. Hohenberger","year":"2009","unstructured":"Hohenberger, S., Waters, B.: Short and Stateless Signatures from the RSA Assumption. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 654\u2013670. Springer, Heidelberg (2009)"},{"unstructured":"Minsky, Y., Trachtenberg, A.: Practical Set Reconciliation, Tech. Rep., Department of Electrical and Computer Engineering, Boston University, Technical Report BU-ECE-2002-01, 2002, a full version can be, downloaded from \n                  \n                    http:\/\/ipsit.bu.edu\/documents\/BUTR2002-01.ps","key":"1_CR10"},{"issue":"9","key":"1_CR11","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1109\/TIT.2003.815784","volume":"49","author":"Y. Minsky","year":"2003","unstructured":"Minsky, Y., Trachtenberg, A., Zippel, R.: Set Reconciliation With Nearly Optimal Communication Complexity. IEEE Transactions on Information Theory\u00a049(9), 2213\u20132218 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/S0097539703437181","volume":"33","author":"V. Pan","year":"2004","unstructured":"Pan, V., Wang, X.: On Rational Number Reconstruction and Approximation. SIAM Journal on Computing\u00a033(2), 502\u2013503 (2004)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation gro\u00dfer Zahlen. Computing\u00a07(3), 281\u2013292 (1971)","journal-title":"Computing"},{"unstructured":"Tridgell, A.: Efficient Algorithms for Sorting and Synchronization, Ph.D. thesis, The Australian National University (1999)","key":"1_CR14"},{"issue":"4","key":"1_CR15","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/0196-6774(91)90033-U","volume":"12","author":"B. Vall\u00e9e","year":"1991","unstructured":"Vall\u00e9e, B.: Gauss\u2019 Algorithm Revisited. Journal of Algorithms\u00a012(4), 556\u2013572 (1991)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1137\/S0097539702408636","volume":"32","author":"X. Wang","year":"2003","unstructured":"Wang, X., Pan, V.: Acceleration of Euclidean Algorithm and Rational Number Reconstruction. SIAM Journal on Computing\u00a032(2), 548\u2013556 (2003)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Trustworthy Global Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41157-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:08:01Z","timestamp":1558303681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41157-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642411564","9783642411571"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41157-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}