How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Non-Interactive CryptoComputing For NC1
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
Extending the EPC network: the potential of RFID in anti-counterfeiting
Proceedings of the 2005 ACM symposium on Applied computing
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Protecting RFID communications in supply chains
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
RFID in the supply chain: panacea or Pandora's box?
Communications of the ACM
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
Efficient Robust Private Set Intersection
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Private Intersection of Certified Sets
Financial Cryptography and Data Security
Cryptographically Secure Bloom-Filters
Transactions on Data Privacy
Sub-linear zero-knowledge argument for correctness of a shuffle
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Privacy-preserving pattern matching for anomaly detection in RFID anti-counterfeiting
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
BLIP: non-interactive differentially-private similarity computation on bloom filters
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Do I know you?: efficient and privacy-preserving common friend-finder protocols and applications
Proceedings of the 29th Annual Computer Security Applications Conference
| Hi-index | 0.00 |
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.