Universally composable private proximity testing

DOI10.1007/978-3-642-24316-5_16MaRDI QIDQ3092361zbMATH OpenOpenAlexFDO

Authors Rafael Tonicelli, Bernardo David, Vinícius de Morais Alves

Publication date 16 September 2011

Published in Provable Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24316-5_16

zbMATH Keywords

commodity-based cryptographyprivate proximity testsUniversal composability

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Multiparty proximity testing with dishonest majority from equality testing
• Faster Privacy-Preserving Location Proximity Schemes
• A new protocol for the nearby friend problem
• Private social-willing detection
• Unconditionally secure disjointness tests for private datasets

Cites work

• A fair and efficient solution to the socialist millionaires' problem
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Constructions and bounds for unconditionally secure non-interactive commitment schemes
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Foundations of Cryptography
• scientific article; zbMATH DE number 1583775 (Why is no real title available?)
• scientific article; zbMATH DE number 1722690 (Why is no real title available?)
• scientific article; zbMATH DE number 1559560 (Why is no real title available?)
• scientific article; zbMATH DE number 2086716 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Information Security
• Keying hash functions for message authentication
• On the necessary and sufficient assumptions for UC computation
• Universally Composable Security Analysis of TLS
• Universally composable two-party and multi-party secure computation
• Verifiable homomorphic oblivious transfer and private equality test

Cited in

(7)

• On Proximity-Oblivious Testing
• Multiparty proximity testing with dishonest majority from equality testing
• Private social-willing detection
• Spatial Bloom filters: enabling privacy in location-aware applications
• A new protocol for the nearby friend problem
• Proximity Oblivious Testing and the Role of Invariances
• Faster Privacy-Preserving Location Proximity Schemes

This page was built for publication: Universally composable private proximity testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092361)