Abstract
Bloom filters provide a space- and time-efficient mean to check the inclusion of an element in a set. In some applications it is beneficial, if the set represented by the Bloom filter is only revealed to authorized parties. Particularly, operations data in supply chain management can be very sensitive and Bloom filters can be applied to supply chain integrity validation. Despite the protection of the represented set, Bloom filter operations, such as the verification of set inclusion, need to be still feasible. In this paper we present privacy-preserving, publicly verifiable Bloom filters which offer both: privacy for the represented set and public Bloom filter operations. We give security proofs in the standard model.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bellovin, S., Cheswick, W.: Privacy-Enhanced Searches Using Encrypted Bloom Filters. Cryptology ePrint Archive Report 2004/022 (2004)
Blass, E., Elkhiyaoui, K., Molva, R.: Tracker: Security and Privacy for RFID-based Supply Chains. In: Proceedinsg of the 18th Network and Distributed System Security Symposium, pp. 455–472 (2011)
Bloom, B.: Space/Time Trade-offs in Hash Coding with Allowable Errors. Communication of the ACM 13(7), 422–426 (1970)
Blum, M., Feldman, P., Micali, S.: Non-Interactive Zero-Knowledge and Its Applications. In: Proceedings of the 20th ACM Symposium on Theory of Computing, pp. 103–112 (1988)
Broder, A., Mitzenmacher, M.: Network Applications of Bloom Filters: A Survey. Internet Mathematics 1(4), 485–509 (2003)
Camenisch, J., Zaverucha, G.: Private Intersection of Certified Sets. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 108–127. Springer, Heidelberg (2009)
Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient Robust Private Set Intersection. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 125–142. Springer, Heidelberg (2009)
De Cristofaro, E., Kim, J., Tsudik, G.: Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 213–231. Springer, Heidelberg (2010)
Eurich, M., Oertel, N., Boutellier, R.: The Impact of Perceived Privacy Risks on Organizations’ Willingness to Share Item-Level Event Data Across the Supply Chain. Electronic Commerce Research 10(3-4), 423–440 (2010)
Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)
Finkenzeller, K.: RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification. John Wiley & Sons, Inc., Chichester (2003)
Freedman, M., Nissim, K., Pinkas, B.: Efficient Private Matching and Set Intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1–19. Springer, Heidelberg (2004)
Fujitsu. Fujitsu Develops World’s First 64KByte High-Capacity FRAM RFID Tag for Aviation Applications. Press Release (2008), http://www.fujitsu.com/global/news/pr/archives/month/2008/20080109-01.html
Gentry, C.: Fully Homomorphic Encryption using Ideal Lattices. In: Proceedings of the 41st ACM Symposium on Theory of Computing, pp. 169–178 (2009)
Goh, E.: Secure Indexes. Cryptology ePrint Archive Report 2003/216 (2003)
Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing but Their Validity or All Languages in NP have Zero-Knowledge Proof Systems. Journal of the ACM 38(3), 690–728 (1991)
Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Computer and Systems Science 28(2), 270–299 (1984)
Groth, J., Ishai, Y.: Sub-Linear Zero-Knowledge Argument for Correctness of a Shuffle. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 379–396. Springer, Heidelberg (2008)
Hazay, C., Lindell, Y.: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 155–175. Springer, Heidelberg (2008)
Katz, J., Lindell, Y.: Introduction to Modern Cryptography: Principles and Protocols. Chapman & Hall/CRC (2007)
Kerschbaum, F., Oertel, N.: Privacy-Preserving Pattern Matching for Anomaly Detection in RFID Anti-Counterfeiting. In: Ors Yalcin, S.B. (ed.) RFIDSec 2010. LNCS, vol. 6370, pp. 124–137. Springer, Heidelberg (2010)
Kissner, L., Song, D.: Privacy-Preserving Set Operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241–257. Springer, Heidelberg (2005)
Lehtonen, M., Michahelles, F., Fleisch, E.: How to Detect Cloned Tags in a Reliable Way from Incomplete RFID Traces. In: Proceedings of the IEEE RFID Conference, pp. 257–264 (2009)
Li, Y., Ding, X.: Protecting RFID Communications in Supply Chains. In: Proceedings of the ACM Symposium on Information, Computer and Communications Security, pp. 234–241 (2007)
Nojima, R., Kadobayashi, Y.: Cryptographically Secure Bloom-Filters. Transactions on Data Privacy 2, 131–139 (2009)
Oertel, N.: Tracking based product authentication: Catching intruders in the supply chain. In: Proceedings of the 17th European Conference on Information Systems (2008)
Ouafi, K., Vaudenay, S.: Pathchecker: an RFID Application for Tracing Products in Suply-Chains. In: Proceedings of the 5th Workshop on RFID Security (2009)
Santos, B., Smith, L.: RFID in the supply chain: panacea or pandora’s box? Communications of the ACM 51(10), 127–131 (2008)
Sander, T., Young, A., Yung, M.: Non-Interactive CryptoComputing For NC1. In: Proceedings of the 40th Symposium on Foundations of Computer Science, pp. 554–567 (1999)
Sarma, S., Brock, D., Engels, D.: Radio frequency identification and the electronic product code. IEEE Micro 21(6), 50–54 (2001)
Staake, T., Thiesse, F., Fleisch, E.: Extending the EPC Network – The Potential of RFID in Anti-Counterfeiting. In: Proceedings of the 20th ACM Symposium on Applied Computing, pp. 1607–1612 (2005)
Waldbaum, M., Nguyen, X.: Using Creativity to Fight a $60 Billion Consumer Problem – Counterfeit Goods. Loyola Chicago Consumer Law Review 10(1), 88 (1998)
Zanetti, D., Fellmann, L., Capkun, S.: Privacy-preserving Clone Detection for RFID-enabled Supply Chains. In: Proceedings of the IEEE International Conference on RFID, pp. 37–44 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 IFIP International Federation for Information Processing
About this paper
Cite this paper
Kerschbaum, F. (2011). Public-Key Encrypted Bloom Filters with Applications to Supply Chain Integrity. In: Li, Y. (eds) Data and Applications Security and Privacy XXV. DBSec 2011. Lecture Notes in Computer Science, vol 6818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22348-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-22348-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22347-1
Online ISBN: 978-3-642-22348-8
eBook Packages: Computer ScienceComputer Science (R0)