Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol

DOI10.1007/978-3-540-71677-8_23MaRDI QIDQ5756545zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Secret SharingMultiparty ComputationBitwise Sharing

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

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)

• Practically efficient secure single-commodity multi-market auctions
• Function secret sharing for mixed-mode and fixed-point secure computation
• A note on secure multiparty computation via higher residue symbols
• Theory of Cryptography
• Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
• Client-aided two-party secure interval test protocol
• Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
• Multiparty computation for modulo reduction without bit-decomposition and a generalization to bit-decomposition
• Secure \(k\)-skyband computation framework in distributed multi-party databases
• Two-server distributed ORAM with sublinear computation and constant rounds
• Secret sharing comparison by transformation and rotation
• A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
• Privacy preserving solution of DCOPs by mediation
• Practically efficient secure distributed exponentiation without bit-decomposition
• Computationally secure pattern matching in the presence of malicious adversaries
• Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
• Private evaluation of a decision tree based on secret sharing
• Efficient secure two-party exponentiation
• PC-SyncBB: a privacy preserving collusion secure DCOP algorithm
• Efficient secure multi-party computation for proof of custody in Ethereum sharding
• Efficient bit-decomposition and modulus-conversion protocols with an honest majority
• \( \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
• Multiparty proximity testing with dishonest majority from equality testing
• Constant-round client-aided secure comparison protocol

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)