Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
From MaRDI portal
Publication:5756545
DOI10.1007/978-3-540-71677-8_23zbMATH Open1161.94422OpenAlexW1888364621MaRDI QIDQ5756545FDOQ5756545
Authors: Takashi Nishide, Kazuo Ohta 
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
Recommendations
- Theory of Cryptography
- Multiparty computation for modulo reduction without bit-decomposition and a generalization to bit-decomposition
- Secure multi-party computation without agreement
- Characterization of secure multiparty computation without broadcast
- Characterization of secure multiparty computation without broadcast
- Secure multiparty computations without computers
- An efficient construction of non-interactive secure multiparty computation
- Multiparty Computations in Non-private Environments
- Generalizing efficient multiparty computation
Cited In (26)
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
- Two-server distributed ORAM with sublinear computation and constant rounds
- Efficient secure multi-party computation for proof of custody in Ethereum sharding
- Practically efficient secure distributed exponentiation without bit-decomposition
- Practically efficient secure single-commodity multi-market auctions
- Privacy preserving solution of DCOPs by mediation
- Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
- PC-SyncBB: a privacy preserving collusion secure DCOP algorithm
- Function secret sharing for mixed-mode and fixed-point secure computation
- Private evaluation of a decision tree based on secret sharing
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation
- Secret sharing comparison by transformation and rotation
- Computationally secure pattern matching in the presence of malicious adversaries
- Efficient bit-decomposition and modulus-conversion protocols with an honest majority
- A note on secure multiparty computation via higher residue symbols
- Secure \(k\)-skyband computation framework in distributed multi-party databases
- Constant-round client-aided secure comparison protocol
- Multiparty computation for modulo reduction without bit-decomposition and a generalization to bit-decomposition
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- Multiparty proximity testing with dishonest majority from equality testing
- Theory of Cryptography
- Efficient secure two-party exponentiation
- Client-aided two-party secure interval test protocol
- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
- Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
This page was built for publication: Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756545)
