Multiparty Proximity Testing with Dishonest Majority from Equality Testing

DOI10.1007/978-3-642-31585-5_48zbMath1367.68017OpenAlexW127830581MaRDI QIDQ3167042

Rafail Ostrovsky, Kina Winoto, Ran Gelles

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Related Items (2)

Multiparty Proximity Testing with Dishonest Majority from Equality Testing ⋮ Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers

Cites Work

• Session-key generation using human passwords only
• Efficient signature generation by smart cards
• Oblivious transfer and polynomial evaluation
• Universally Composable Private Proximity Testing
• Multiparty Proximity Testing with Dishonest Majority from Equality Testing
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Universally Composable Password-Based Key Exchange
• Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
• A Survey of Single-Database Private Information Retrieval: Techniques and Applications
• Theory of Cryptography
• Advances in Cryptology - ASIACRYPT 2003
• A fair and efficient solution to the socialist millionaires' problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multiparty Proximity Testing with Dishonest Majority from Equality Testing