Theory of Cryptography
From MaRDI portal
Publication:5898360
Recommendations
- Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
- Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
- Secret sharing comparison by transformation and rotation
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Multi-party computation with conversion of secret sharing
Cited in
(50)- Compilation of function representations for secure computing paradigms
- Distributed Private Data Analysis: Simultaneously Solving How and What
- Two-server distributed ORAM with sublinear computation and constant rounds
- Amortizing division and exponentiation
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
- Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
- Efficient secure multi-party computation for proof of custody in Ethereum sharding
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Practically efficient secure single-commodity multi-market auctions
- An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks
- Private database access with HE-over-ORAM architecture
- Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Efficient secure multiparty computation of sparse vector dot products
- Privacy preserving solution of DCOPs by mediation
- Secure Multi-party Shuffling
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
- Function secret sharing for mixed-mode and fixed-point secure computation
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
- Secure computation with preprocessing via function secret sharing
- Practical and efficient FHE-based MPC
- Probabilistically correct secure arithmetic computation for modular conversion, zero test, comparison, MOD and exponentiation
- Secure equality and greater-than tests with sublinear online complexity
- Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation
- Private evaluation of a decision tree based on secret sharing
- Private liquidity matching using MPC
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Secret sharing comparison by transformation and rotation
- Efficient bit-decomposition and modulus-conversion protocols with an honest majority
- A note on secure multiparty computation via higher residue symbols
- Graph coloring applied to secure computation in non-abelian groups
- Secure two-party input-size reduction: challenges, solutions and applications
- Constant-round client-aided secure comparison protocol
- Secure computation, I/O-efficient algorithms and distributed signatures
- Multiparty proximity testing with dishonest majority from equality testing
- Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations
- Efficient secure two-party exponentiation
- Generic constant-round oblivious sorting algorithm for MPC
- Selected application of the Chinese remainder theorem in multiparty computation
- Client-aided two-party secure interval test protocol
- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
- Efficient Binary Conversion for Paillier Encrypted Values
- Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext
- Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Efficient two-party exponentiation from quotient transfer
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
This page was built for publication: Theory of Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898360)
