Cryptographically Secure Bloom-Filters

被引:0
|
作者
Nojima, Ryo [1 ]
Kadobayashi, Youki [2 ]
机构
[1] Natl Inst Informat & Commun Technol NICT, 4-2-1 Nukuikitamachi, Koganei, Tokyo 1848795, Japan
[2] Nara Inst Sci Technol NAIST, Ikoma, Nara 6300192, Japan
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we propose a privacy-preserving variant of Bloom-filters. The Bloom-filter has many applications such as hash-based IP-traceback systems and Web cache sharing. In some of those applications, equipping the Bloom-filter with the privacy-preserving mechanism is crucial for the deployment. In this paper, we propose a cryptographically secure privacy-preserving Bloom-filter protocol. We propose such two protocols based on blind signatures and oblivious pseudorandom functions, respectively. To show that the proposed protocols are secure, we provide a reasonable security definition and prove the security.
引用
收藏
页码:131 / 139
页数:9
相关论文
共 50 条
  • [21] Meteor: Cryptographically Secure Steganography for Realistic Distributions
    Kaptchuk, Gabriel
    Jois, Tushar M.
    Green, Matthew
    Rubin, Aviel D.
    [J]. CCS '21: PROCEEDINGS OF THE 2021 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2021, : 1529 - 1548
  • [22] CRYPTOGRAPHICALLY SECURE RADIOS BASED ON DIRECTIONAL MODULATION
    Pellegrini, V.
    Principe, F.
    de Mauro, G.
    Guidi, R.
    Martorelli, V.
    Cioni, R.
    [J]. 2014 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2014,
  • [23] A secure high-speed identification scheme for RFID using bloom filters
    Nohara, Yasunobu
    Inoue, Sozo
    Yasuura, Hiroto
    [J]. ARES 2008: PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON AVAILABILITY, SECURITY AND RELIABILITY, 2008, : 717 - 722
  • [24] An Ultrafast Cryptographically Secure Pseudorandom Number Generator
    Zheng, Jianliang
    Li, Jie
    [J]. INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2022, 2023, 13849 : 267 - 291
  • [25] BLOOM FILTERS
    WELLS, B
    [J]. DR DOBBS JOURNAL, 1995, 20 (01): : 12 - 12
  • [26] CRYPTOGRAPHICALLY STRONG UNDENIABLE SIGNATURES, UNCONDITIONALLY SECURE FOR THE SIGNER
    CHAUM, D
    VANHEIJST, E
    PFITZMANN, B
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 576 : 470 - 484
  • [27] Cryptographically secure substitutions based on the approximation of mixing maps
    Szczepanski, J
    Amigó, JM
    Michalek, T
    Kocarev, L
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2005, 52 (02) : 443 - 453
  • [28] SFour: A Protocol for Cryptographically Secure Record Linkage at Scale
    Khurram, Basit
    Kerschbaum, Florian
    [J]. 2020 IEEE 36TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2020), 2020, : 277 - 288
  • [29] Correlation properties of a class of cryptographically secure spreading sequences
    Kemp, AH
    Shepherd, SJ
    Barton, SK
    [J]. IEEE ISSSTA '96 - IEEE FOURTH INTERNATIONAL SYMPOSIUM ON SPREAD SPECTRUM TECHNIQUES & APPLICATIONS, PROCEEDINGS, VOLS 1-3, 1996, : 945 - 949
  • [30] A cryptographically secure ew database with selective random access
    Ikram, N
    Shepherd, SJ
    [J]. MILCOM 97 PROCEEDINGS, VOLS 1-3, 1997, : 1407 - 1411