乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T03:44:12Z","timestamp":1719891852832},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,27]],"date-time":"2020-12-27T00:00:00Z","timestamp":1609027200000},"content-version":"am","delay-in-days":301,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1016\/j.jpdc.2019.10.002","type":"journal-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T16:22:45Z","timestamp":1573143765000},"page":"246-251","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A precise non-asymptotic complexity analysis of parallel hash functions without tree topology constraints"],"prefix":"10.1016","volume":"137","author":[{"given":"Kevin","family":"Atighehchi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.jpdc.2019.10.002_b1","doi-asserted-by":"crossref","first-page":"212","DOI":"10.46586\/tosc.v2017.i4.212-239","article-title":"Asymptotic analysis of plausible tree hash modes for SHA-3","volume":"2017","author":"Atighehchi","year":"2017","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"10.1016\/j.jpdc.2019.10.002_b2","unstructured":"K. Atighehchi, R. Rolland, Optimization of tree modes for parallel hash functions, CoRR abs\/1512.05864, arXiv:1512.05864 URL http:\/\/arxiv.org\/abs\/1512.05864."},{"issue":"9","key":"10.1016\/j.jpdc.2019.10.002_b3","doi-asserted-by":"crossref","first-page":"1585","DOI":"10.1109\/TC.2017.2693185","article-title":"Optimization of tree modes for parallel hash functions: A Case study","volume":"66","author":"Atighehchi","year":"2017","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.jpdc.2019.10.002_b4","series-title":"Proceedings of the 11th International Conference on Applied Cryptography and Network Security","first-page":"119","article-title":"BLAKE2: Simpler, smaller, fast as md5","author":"Aumasson","year":"2013"},{"key":"10.1016\/j.jpdc.2019.10.002_b5","series-title":"Advances in Cryptology \u2013 EUROCRYPT 2013: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings","first-page":"313","article-title":"Keccak","author":"Bertoni","year":"2013"},{"key":"10.1016\/j.jpdc.2019.10.002_b6","series-title":"Applied Cryptography and Network Security","first-page":"217","article-title":"Sakura: A flexible coding for tree hashing","volume":"vol. 8479","author":"Bertoni","year":"2014"},{"issue":"4","key":"10.1016\/j.jpdc.2019.10.002_b7","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10207-013-0220-y","article-title":"Sufficient conditions for sound tree and sequential hashing modes","volume":"13","author":"Bertoni","year":"2014","journal-title":"Int. J. Inf. Secur."},{"key":"10.1016\/j.jpdc.2019.10.002_b8","doi-asserted-by":"crossref","unstructured":"J. Coron, Y. Dodis, C. Malinaud, P. Puniya, Merkle-Damg\u00e5rd revisited: How to construct a hash function, in: Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings, 2005, pp. 430\u2013448.","DOI":"10.1007\/11535218_26"},{"key":"10.1016\/j.jpdc.2019.10.002_b9","series-title":"The skein hash function family (version 1.2)","author":"Ferguson","year":"2009"},{"key":"10.1016\/j.jpdc.2019.10.002_b10","series-title":"Special Publication 800-185. SHA-3 derived functions: cSHAKE, KMAC, TupleHash and Parallel-Hash Tech. Rep.","author":"Kelsey","year":"2016"},{"issue":"10","key":"10.1016\/j.jpdc.2019.10.002_b11","doi-asserted-by":"crossref","first-page":"2301","DOI":"10.1093\/ietfec\/e90-a.10.2301","article-title":"Indifferentiability of single-block-length and rate-1 compression functions","volume":"90-A","author":"Kuwakado","year":"2007","journal-title":"IEICE Trans."},{"key":"10.1016\/j.jpdc.2019.10.002_b12","series-title":"Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology","first-page":"368","article-title":"Hash functions based on block ciphers: A synthetic approach","author":"Preneel","year":"1994"},{"key":"10.1016\/j.jpdc.2019.10.002_b13","series-title":"The md6 hash function: A proposal to nist for sha-3","author":"Rivest","year":"2008"},{"key":"10.1016\/j.jpdc.2019.10.002_b14","series-title":"The sandstorm hash. submission to nist sha-3 competition","author":"Torgerson","year":"2008"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731518308682?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731518308682?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T23:21:33Z","timestamp":1659568893000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731518308682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":14,"alternative-id":["S0743731518308682"],"URL":"https:\/\/doi.org\/10.1016\/j.jpdc.2019.10.002","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2020,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A precise non-asymptotic complexity analysis of parallel hash functions without tree topology constraints","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jpdc.2019.10.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}