Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
From MaRDI portal
Publication:5756545
DOI10.1007/978-3-540-71677-8_23zbMath1161.94422OpenAlexW1888364621MaRDI QIDQ5756545
Publication date: 4 September 2007
Published in: Public Key Cryptography – PKC 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71677-8_23
Related Items (19)
Multiparty Proximity Testing with Dishonest Majority from Equality Testing ⋮ \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation ⋮ Efficient noise generation to achieve differential privacy with applications to secure multiparty computation ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ Constant-round client-aided secure comparison protocol ⋮ Secure \(k\)-skyband computation framework in distributed multi-party databases ⋮ Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption ⋮ Privacy preserving solution of DCOPs by mediation ⋮ Private evaluation of a decision tree based on secret sharing ⋮ Client-Aided Two-Party Secure Interval Test Protocol ⋮ A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals ⋮ PC-SyncBB: a privacy preserving collusion secure DCOP algorithm ⋮ A note on secure multiparty computation via higher residue symbols ⋮ Efficient Secure Two-Party Exponentiation ⋮ Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ Function secret sharing for mixed-mode and fixed-point secure computation ⋮ Two-server distributed ORAM with sublinear computation and constant rounds ⋮ Practically Efficient Secure Single-Commodity Multi-market Auctions
This page was built for publication: Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
