Efficient Robust Private Set Intersection
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Fast secure computation of set intersection
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Privacy-preserving group discovery with linear complexity
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Fair and privacy-preserving multi-party protocols for reconciling ordered input sets
ISC'10 Proceedings of the 13th international conference on Information security
Lightweight delegated subset test with privacy protection
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Private discovery of common social contacts
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Public-key encrypted bloom filters with applications to supply chain integrity
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
Countering GATTACA: efficient and secure testing of fully-sequenced human genomes
Proceedings of the 18th ACM conference on Computer and communications security
Practical private set intersection protocols with linear complexity
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Mutual private set intersection with linear complexity
WISA'11 Proceedings of the 12th international conference on Information Security Applications
Efficient robust private set intersection
International Journal of Applied Cryptography
Constant-Round multi-party private set union using reversed laurent series
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Policy-Enhanced private set intersection: sharing information while enforcing privacy policies
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Size-hiding in private set intersection: existential results and constructions
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Outsourced private set intersection using homomorphic encryption
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Privacy-preserving disjunctive normal form operations on distributed sets
Information Sciences: an International Journal
When private set intersection meets big data: an efficient and scalable protocol
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Redeem with privacy (RWP): privacy protecting framework for geo-social commerce
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Do I know you?: efficient and privacy-preserving common friend-finder protocols and applications
Proceedings of the 29th Annual Computer Security Applications Conference
Fair private set intersection with a semi-trusted arbiter
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
Bloom filter bootstrap: privacy-preserving estimation of the size of an intersection
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
Hi-index | 0.00 |
This paper introduces certified sets to the private set intersection problem. A private set intersection protocol allows Alice and Bob to jointly compute the set intersection function without revealing their input sets. Since the inputs are private, malicious participants may choose their sets arbitrarily and may use this flexibility to affect the result or learn more about the input of an honest participant. With certified sets, a trusted party ensures the inputs are valid and binds them to each participant. The strength of the malicious model with certified inputs increases the applicability of private set intersection to real world problems. With respect to efficiency the new certified set intersection protocol improves existing malicious model private set intersection protocols by a constant factor.