Universally Composable Private Proximity Testing

DOI10.1007/978-3-642-24316-5_16zbMath1298.94109OpenAlexW30272468MaRDI QIDQ3092361

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

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)

Related Items (2)

Multiparty Proximity Testing with Dishonest Majority from Equality Testing ⋮ Spatial Bloom Filters: Enabling Privacy in Location-Aware Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructions and bounds for unconditionally secure non-interactive commitment schemes
• On the Necessary and Sufficient Assumptions for UC Computation
• Keying Hash Functions for Message Authentication
• Universally composable two-party and multi-party secure computation
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Foundations of Cryptography
• Efficient Two Party and Multi Party Computation Against Covert Adversaries
• Information Security
• Universally Composable Security Analysis of TLS
• Advances in Cryptology - ASIACRYPT 2003
• A fair and efficient solution to the socialist millionaires' problem

This page was built for publication: Universally Composable Private Proximity Testing