Multiparty proximity testing with dishonest majority from equality testing
From MaRDI portal
Recommendations
Cites work
- A fair and efficient solution to the socialist millionaires' problem
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- Advances in Cryptology - EUROCRYPT 2004
- Efficient signature generation by smart cards
- Foundations of Cryptography
- scientific article; zbMATH DE number 1808213 (Why is no real title available?)
- scientific article; zbMATH DE number 1186931 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1759277 (Why is no real title available?)
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Multiparty proximity testing with dishonest majority from equality testing
- Oblivious transfer and polynomial evaluation
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Session-key generation using human passwords only
- Theory of Cryptography
- Universally Composable Password-Based Key Exchange
- Universally composable private proximity testing
- Verifiable homomorphic oblivious transfer and private equality test
Cited in
(7)- Location-proof system based on secure multi-party computations
- Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers
- Universally composable private proximity testing
- Multiparty proximity testing with dishonest majority from equality testing
- Private social-willing detection
- A new protocol for the nearby friend problem
- Faster Privacy-Preserving Location Proximity Schemes
This page was built for publication: Multiparty proximity testing with dishonest majority from equality testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167042)