Pages that link to "Item:Q3003382"
From MaRDI portal
The following pages link to Semi-homomorphic Encryption and Multiparty Computation (Q3003382):
Displayed 50 items.
- Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- On the amortized complexity of zero-knowledge protocols (Q744603) (← links)
- Oblivious TLS via multi-party computation (Q826241) (← links)
- A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle (Q897888) (← links)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Yet another compiler for active security or: efficient MPC over arbitrary rings (Q1784116) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Privacy preserving anomaly detection based on local density estimation (Q2038743) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← links)
- Secure multi-party quantum computation with a dishonest majority (Q2055679) (← links)
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \) (Q2055698) (← links)
- Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP (Q2128571) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation (Q2145391) (← links)
- Full-threshold actively-secure multiparty arithmetic circuit garbling (Q2146106) (← links)
- The cost of IEEE arithmetic in secure computation (Q2146109) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Secure computation with preprocessing via function secret sharing (Q2175917) (← links)
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security (Q2179391) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- Maliciously secure matrix multiplication with applications to private deep learning (Q2691579) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- Maliciously circuit-private multi-key FHE and MPC based on LWE (Q2701482) (← links)
- Better Preprocessing for Secure Multiparty Computation (Q2822679) (← links)
- Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
- High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- On CCA-Secure Somewhat Homomorphic Encryption (Q2889863) (← links)
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations (Q2947113) (← links)
- Cheater Detection in SPDZ Multiparty Computation (Q2953814) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367) (← links)
- Secure Computation with Minimal Interaction, Revisited (Q3457074) (← links)