{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T00:40:04Z","timestamp":1743813604803,"version":"3.40.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. Telecommun."],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/bf03219928","type":"journal-article","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T12:21:00Z","timestamp":1342786860000},"page":"662-681","source":"Crossref","is-referenced-by-count":9,"title":["Secure time-stamping schemes: a distributed point of view","Proc\u00e9d\u00e9s S\u00fbrs D\u2019horodatage : Un Point de Vue R\u00e9parti"],"prefix":"10.1007","volume":"61","author":[{"given":"Alexis","family":"Bonnecaze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Liardet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alban","family":"Gabillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaouther","family":"Blibech","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03219928_CR1","unstructured":"Aldous (D.), Random walks on finite groups and rapidly mixing Markov chains, S\u00e9minaire de Probabilit\u00e9s XVII (1981\/82), 243\u2013297. Lecture Notes in Math. 1059, Springer, Berlin, pp. 245\u2013255, 1983."},{"key":"BF03219928_CR2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.2307\/2323590","volume":"93","author":"(D.) Aldous","year":"1986","unstructured":"Aldous (D.), Diaconis (P.),Shuffling cards and stopping times, Am. Math. Monthly93, pp. 333\u2013348, 1986.","journal-title":"Am. Math. Monthly"},{"key":"BF03219928_CR3","unstructured":"Benaloh (J.),De Mare (M.),Efficient Broadcast time-stamping Technical Report 1, Clarkson University Department of Mathematics and Computer Science, August 1991."},{"key":"BF03219928_CR4","doi-asserted-by":"crossref","unstructured":"Benaloh (J.),De Mare (M.),One-Way Accumulators: A Decentralized Alternative to Digital Signatures Advances in Cryptology-Eurocrypt\u201993.Lncs, vol. 765, pp. 274\u2013285, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-48285-7_24"},{"key":"BF03219928_CR5","doi-asserted-by":"crossref","unstructured":"Blibech (K.),Gabillon (A.),chronos: An Authenticated Dictionary Based on Skip Lists forTimestamping Systems, 2005Acm Workshop on Secure Web Services (Sws) November 11, 2005 Fairfax, VA, USA.","DOI":"10.1145\/1103022.1103037"},{"key":"BF03219928_CR6","doi-asserted-by":"crossref","unstructured":"Blibech (K.),Gabillon (A.), A NewTimestamping Scheme Based on Skip Lists. To be presented at the next Applied Cryptography and Information Security conference (Acis). Glasgow, May 2006.","DOI":"10.1007\/11751595_43"},{"key":"BF03219928_CR7","doi-asserted-by":"crossref","unstructured":"Buldas (A.),Laud (P.),Lipmaa (H.),Villemson (J.)Time-stamping with Binary Linking Schemes, Advances on Cryptology \u2014Crypto\u203298, Lecture Notes in Computer Science, Springer-Verlag, pp. 486\u2013501, 1998.","DOI":"10.1007\/BFb0055749"},{"key":"BF03219928_CR8","unstructured":"Buldas (A.),Lipmaa (H.),Digital Signatures, Timestamping and the Corresponding Infrastructure K\u00fcberneetika AS, Technical Report, 21 Jan. 98."},{"key":"BF03219928_CR9","doi-asserted-by":"crossref","unstructured":"Buldas (A.),Lipmaa (H.),Schoenmakers (B.),Optimally Efficient Accountable Time-Stamping, in Yuliang Zheng and Hideki 1mai, editors, Public Key Cryptography\u20322000, volume 1751 of Lecture Notes in Computer Science, pp. 293\u2013305, Melbourne, Australia, Springer-Verlag, January 18\u201320, 2000.","DOI":"10.1007\/978-3-540-46588-1_20"},{"key":"BF03219928_CR10","doi-asserted-by":"crossref","unstructured":"Feldman (P.),Micali (S.)Optimal algorithms for Byzantine agreement, Proceedings of the twentieth annualAcm symposium on Theory of computing table of contents Chicago, Illinois, United States pp. 148\u2013161, 1988.","DOI":"10.1145\/62212.62225"},{"key":"BF03219928_CR11","doi-asserted-by":"crossref","unstructured":"Gabillon (A.),Byun (J-S.), \u201cA Two-Level Time-stamping System\u201d,Ifip\/sec\u203201, Paris, France, 11\u201313 June 2001.","DOI":"10.1007\/0-306-46998-7_10"},{"issue":"2","key":"BF03219928_CR12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF00196791","volume":"3","author":"(S.) Haber","year":"1991","unstructured":"Haber (S.), Stornetta (W.S.) How to Time-Stamp a Digital Document, Journal of Cryptology: the Journal of the International Association for Cryptologic Research 3(2), pp. 99\u2013112, 1991.","journal-title":"Journal of Cryptology: the Journal of the International Association for Cryptologic Research"},{"key":"BF03219928_CR13","unstructured":"Just (M.),Some Timestamping Protocol Failures, Internet Society Symposium on Network and Distributed System Security, San Diego, CA, Mar 11\u201313, 1998."},{"key":"BF03219928_CR14","unstructured":"Knuth (D.E.),The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Addison-Wesley, reading Mass., second edition (1981)."},{"key":"BF03219928_CR15","unstructured":"Knuth (D.E.),The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Addison-Wesley, reading Mass., second edition, 1981."},{"key":"BF03219928_CR16","unstructured":"Maniatis (P.),Giuli (T.J.),Baker (M.),Enabling the Long-Term Archival of Signed Documents through time-stamping, CoRR. cs.DC\/0 106058: (2001)."},{"key":"BF03219928_CR17","doi-asserted-by":"crossref","unstructured":"Massias (H.),Serret (X.),Quisquater (J.),Timestamps: Main issues on their use and implementation In Proceedings ofIeee 8th International Workshops on enabling Technologies: Infrastructure for Collaborative Enterprises \u2014 Fourth International Workshop on Enterprise Security, pp. 178\u2013183, June 1999. ISBN 0-7695-0365-9.","DOI":"10.1109\/ENABL.1999.805196"},{"key":"BF03219928_CR18","doi-asserted-by":"crossref","unstructured":"Massias (H.),Quisquater (J.),Timestamps: Main issues on their use and implementation, In Proceedings ofIeee 8th International Workshops on enabling Technologies: Infrastructure for Collaborative Enterprises \u2014 Fourth International Workshop on Enterprise Security, pp. 178\u2013183, June 1999.Isbn 0-7695-0365-9.","DOI":"10.1109\/ENABL.1999.805196"},{"key":"BF03219928_CR19","unstructured":"Merkle (P.),Secrecy, authentication, and public key systems, Ph.D. dissertation, Dept. of Electrical Engineering, Stanford Univ., 1979."},{"key":"BF03219928_CR20","unstructured":"Nijenhuis (A.),Wilf (H.S.),Combinatorial Algorithms for Computers and Calculators, Acad. Press, Inc., second ed. 1978."},{"issue":"6","key":"BF03219928_CR21","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"(W.) Pugh","year":"1990","unstructured":"Pugh (W.),Skip Lists:Skip lists: Aprobabilistic alternative to balanced trees, Communications of theAcm, 33(6) pp. 668\u2013676, June 1990.","journal-title":"Communications of the Acm"},{"key":"BF03219928_CR22","unstructured":"Sloane (N.J.A.), Encrypting byRandom Rotations, Cryptography Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, Edited by Thomas Beth,Lncs 149 (1983), pp. 71\u2013128."},{"key":"BF03219928_CR23","unstructured":"Takura (A.),Ono (S.),Naito (S.)A Secure and trusted Time Satmping Authority, Proceedings ofIws 99, 1999, pp. 12372\u2013128."}],"container-title":["annals of telecommunications - annales des t\u00e9l\u00e9communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03219928.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03219928\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03219928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T00:13:30Z","timestamp":1743812010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03219928"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":23,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["BF03219928"],"URL":"https:\/\/doi.org\/10.1007\/bf03219928","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"type":"print","value":"0003-4347"},{"type":"electronic","value":"1958-9395"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}