The following pages link to Theory of Cryptography (Q5898360):
Displaying 45 items.
- Compilation of function representations for secure computing paradigms (Q826238) (← links)
- Efficient bit-decomposition and modulus-conversion protocols with an honest majority (Q1784437) (← links)
- Graph coloring applied to secure computation in non-abelian groups (Q1928772) (← links)
- A note on secure multiparty computation via higher residue symbols (Q2040551) (← links)
- Function secret sharing for mixed-mode and fixed-point secure computation (Q2056774) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
- Efficient two-party exponentiation from quotient transfer (Q2096636) (← links)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation (Q2145391) (← links)
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation (Q2145393) (← links)
- Private liquidity matching using MPC (Q2152152) (← links)
- Constant-round client-aided secure comparison protocol (Q2167759) (← links)
- Secure computation with preprocessing via function secret sharing (Q2175917) (← links)
- Selected application of the Chinese remainder theorem in multiparty computation (Q2201218) (← links)
- An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks (Q2229283) (← links)
- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals (Q2229288) (← links)
- Private Database Access with HE-over-ORAM Architecture (Q2794501) (← links)
- Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation (Q2811125) (← links)
- Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation (Q2822680) (← links)
- Secure Computation, I/O-Efficient Algorithms and Distributed Signatures (Q2890013) (← links)
- Efficient Secure Two-Party Exponentiation (Q3073692) (← links)
- Generic Constant-Round Oblivious Sorting Algorithm for MPC (Q3092362) (← links)
- Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security (Q3102211) (← links)
- Multiparty Proximity Testing with Dishonest Majority from Equality Testing (Q3167042) (← links)
- Client-Aided Two-Party Secure Interval Test Protocol (Q3297629) (← links)
- Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations (Q3404401) (← links)
- Secure Multi-party Shuffling (Q3460735) (← links)
- Our Data, Ourselves: Privacy Via Distributed Noise Generation (Q3593113) (← links)
- Efficient Binary Conversion for Paillier Encrypted Values (Q3593115) (← links)
- Distributed Private Data Analysis: Simultaneously Solving How and What (Q3600234) (← links)
- Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values (Q3623058) (← links)
- Efficient secure multiparty computation of sparse vector dot products (Q5031929) (← links)
- Round Efficient Unconditionally Secure Multiparty Computation Protocol (Q5504622) (← links)
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol (Q5756545) (← links)
- Practically Efficient Secure Single-Commodity Multi-market Auctions (Q5857771) (← links)
- Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption (Q6041282) (← links)
- Secure two-party input-size reduction: challenges, solutions and applications (Q6081302) (← links)
- Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext (Q6123051) (← links)
- Privacy preserving solution of DCOPs by mediation (Q6161505) (← links)
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s (Q6164395) (← links)
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data (Q6554885) (← links)
- Efficient secure multi-party computation for proof of custody in Ethereum sharding (Q6564095) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)
- Practical and efficient FHE-based MPC (Q6595949) (← links)
