Secure equality and greater-than tests with sublinear online complexity
From MaRDI portal
Recommendations
Cited in
(12)- New protocols for secure equality test and comparison
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- Constant-round client-aided secure comparison protocol
- Communication-efficient (client-aided) secure two-party protocols and its application
- Private database access with HE-over-ORAM architecture
- Encryption switching protocols
- A secure and efficient protocol for electronic treasury auctions
- Sub-linear, secure comparison with two non-colluding parties
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- Practically efficient secure single-commodity multi-market auctions
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
- Fully tally-hiding verifiable E-voting for real-world elections with seat-allocations
This page was built for publication: Secure equality and greater-than tests with sublinear online complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5327472)