乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T06:40:15Z","timestamp":1721284815029},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"ACHILLES","award":["PID2019-104207RB-I00"]},{"name":"ENTRUDIT","award":["TED2021-130118B-I00"]},{"name":"Spanish Agencia Estatal de Investigación"},{"name":"DFG","award":["465963632"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1109\/tdsc.2023.3298967","type":"journal-article","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T18:54:26Z","timestamp":1690397666000},"page":"1981-1993","source":"Crossref","is-referenced-by-count":0,"title":["On the Privacy of Multi-Versioned Approximate Membership Check Filters"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-2540-5234","authenticated-orcid":false,"given":"Pedro","family":"Reviriego","sequence":"first","affiliation":[{"name":"Universidad Politécnica de Madrid, Madrid, Spain"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2220-0594","authenticated-orcid":false,"given":"Alfonso","family":"S\u00e1nchez-Macian","sequence":"additional","affiliation":[{"name":"Universidad Carlos III de Madrid, Madrid, Spain"}]},{"ORCID":"http:\/\/orcid.org\/0009-0000-2662-2607","authenticated-orcid":false,"given":"Peter C.","family":"Dillinger","sequence":"additional","affiliation":[{"name":"Meta Platforms, Inc., Seattle, WA, USA"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6477-0106","authenticated-orcid":false,"given":"Stefan","family":"Walzer","sequence":"additional","affiliation":[{"name":"University of Cologne, Cologne, Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2018.2883785"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2019.2951984"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3080008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2889329"},{"key":"ref5","first-page":"98","article-title":"Privacy-conscious threat intelligence using DNSBLoom","volume-title":"Proc. IFIP\/IEEE Int. Symp. Integr. Netw. Manage.","author":"van Rijswijk-Deij"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2980835"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-9-41"},{"key":"ref8","article-title":"Privacy-enhanced searches using encrypted bloom filters","author":"Bellovin","year":"2004","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2021.3128821"},{"issue":"2","key":"ref10","first-page":"26","article-title":"Cardinality estimators do not preserve privacy","volume-title":"Proc. Privacy Enhancing Technol.","volume":"2019","author":"Desfontaines"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2664243.2664267"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33627-0_27"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2022.3158469"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2022.3202753"},{"key":"ref15","first-page":"289","article-title":"Evaluation of hardening techniques for privacy-preserving record linkage","volume-title":"Proc. 24th Int. Conf. Extending Database Technol.","author":"Franke"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2272604"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.11.002"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"ref20","first-page":"823","article-title":"An optimal bloom filter replacement","volume-title":"Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Pagh"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3376122"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3339504"},{"key":"ref24","first-page":"57","article-title":"Fast and accurate bitstate verification for SPIN","volume-title":"Proc. 11th Int. SPIN Workshop Model Checking Softw.","author":"Dillinger"},{"key":"ref25","first-page":"39:1","article-title":"Efficient Gauss elimination for near-quadratic matrices with one short random block per row, with applications","volume-title":"Proc. 27th Annu. Eur. Symp. Algorithms","author":"Dietzfelbinger"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.131"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3584372.3588674"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02652-2_6"},{"key":"ref30","first-page":"30","article-title":"The Bloomier filter: An efficient data structure for static support lookup tables","volume-title":"Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Chazelle"},{"key":"ref31","first-page":"339","article-title":"Fast scalable construction of (minimal perfect hash) functions","volume-title":"Proc. 15th Int. Symp. Exp. Algorithms","author":"Genuzio"},{"key":"ref32","first-page":"4:1","article-title":"Fast succinct retrieval and approximate membership using ribbon","volume-title":"Proc. 20th Int. Symp. Exp. Algorithms","author":"Dillinger"},{"key":"ref33","first-page":"1","article-title":"An efficient caching mechanism for network-based URL filtering by multi-level counting bloom filters","volume-title":"Proc. IEEE Int. Conf. Commun.","author":"Feng"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062172"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.3024680"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3230636"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/tc.1984.1676499"},{"key":"ref38","first-page":"367","article-title":"Bloom filters in probabilistic verification","volume-title":"Proc. 5th Int. Conf. Formal Methods Comput.-Aided Des.","author":"Dillinger"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1594230"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2002.803864"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2015.21"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/10592103\/10195241.pdf?arnumber=10195241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T06:09:55Z","timestamp":1721282995000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10195241\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":41,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2023.3298967","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"value":"1545-5971","type":"print"},{"value":"1941-0018","type":"electronic"},{"value":"2160-9209","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7]]}}}