{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T12:26:37Z","timestamp":1730291197327,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,12,13]]},"DOI":"10.1109\/pst52912.2021.9647740","type":"proceedings-article","created":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T21:08:01Z","timestamp":1640120881000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Updatable Linear Map Commitments and Their Applications in Elementary Databases"],"prefix":"10.1109","author":[{"given":"Guiwen","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shihui","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guang","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"ref11","article-title":"Functional commitment schemes: From polynomial commitments to pairing-based accumulators from simple assumptions","author":"libert","year":"2016","journal-title":"43rd International Colloquium on Automata Languages and Programming (ICALP 2016)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"ref13","first-page":"953","article-title":"Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge","volume":"2019","author":"gabizon","year":"2019","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339817"},{"key":"ref15","first-page":"81","article-title":"Efficient polynomial commitment schemes for multiple points and polynomials","volume":"2020","author":"boneh","year":"2020","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_25"},{"key":"ref18","first-page":"129","article-title":"Non-interactive and information-theoretic secure verifiable secret sharing","author":"pedersen","year":"1991","journal-title":"Annual International Cryptology Conference"},{"journal-title":"Standard","article-title":"GM\/T 0044.5 - 2016: Identity-based cryptographic algorithms SM9 - Part 5: Parameter definition","year":"2016","key":"ref19"},{"key":"ref4","first-page":"40","article-title":"Direct minimum-knowledge computations","volume":"87","author":"yung","year":"1998","journal-title":"Proc Crypto"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_19"},{"key":"ref5","first-page":"63","article-title":"Commitment schemes and zero-knowledge protocols","author":"damg\u00e5rd","year":"1998","journal-title":"School organized by the European Educational Forum"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17253-4_9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008911"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"journal-title":"A taxonomy of pairings their security their complexity","year":"2019","author":"barbulescu","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/AIIoT52608.2021.9454223"}],"event":{"name":"2021 18th International Conference on Privacy, Security and Trust (PST)","start":{"date-parts":[[2021,12,13]]},"location":"Auckland, New Zealand","end":{"date-parts":[[2021,12,15]]}},"container-title":["2021 18th International Conference on Privacy, Security and Trust (PST)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9647713\/9647738\/09647740.pdf?arnumber=9647740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:59:50Z","timestamp":1652201990000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9647740\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,13]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/pst52912.2021.9647740","relation":{},"subject":[],"published":{"date-parts":[[2021,12,13]]}}}