Secure Equality and Greater-Than Tests with Sublinear Online Complexity

DOI10.1007/978-3-642-39212-2_56zbMath1335.68298OpenAlexW2144929714MaRDI QIDQ5327472

Tomas Toft, Helger Lipmaa

Publication date: 7 August 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-39212-2_56

zbMATH Keywords

secure comparisonadditively homomorphic encryptionarithmetic black boxsecure equality test

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data encryption (aspects in computer science) (68P25) Online algorithms; streaming algorithms (68W27)

Related Items (7)

\( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ A Secure and Efficient Protocol for Electronic Treasury Auctions ⋮ \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s ⋮ Private Database Access with HE-over-ORAM Architecture ⋮ Encryption Switching Protocols ⋮ Practically Efficient Secure Single-Commodity Multi-market Auctions

This page was built for publication: Secure Equality and Greater-Than Tests with Sublinear Online Complexity