The following pages link to Theory of Cryptography (Q5711651):
Displaying 43 items.
- On optimal cryptographic key derivation (Q388109) (← links)
- Multi-party computation with conversion of secret sharing (Q664384) (← links)
- FROST: Flexible round-optimized Schnorr threshold signatures (Q832324) (← links)
- Best possible information-theoretic MPC (Q1631330) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Distributed key generation for SM9-based systems (Q2057137) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- MPC with friends and foes (Q2096545) (← links)
- Fluid MPC: secure multiparty computation with dynamic participants (Q2128557) (← links)
- Improving the efficiency of AES protocols in multi-party computation (Q2145388) (← links)
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation (Q2145393) (← links)
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms (Q2146105) (← links)
- Complexity and performance of secure floating-point polynomial evaluation protocols (Q2148764) (← links)
- Distributed (correlation) samplers: how to remove a trusted dealer in one round (Q2170033) (← links)
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions (Q2210433) (← links)
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority (Q2229285) (← links)
- A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals (Q2229288) (← links)
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation (Q2330096) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- Random-index PIR and applications (Q2697885) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- Secure Outsourced Computation (Q3011899) (← links)
- Binary AMD Circuits from Secure Multiparty Computation (Q3179363) (← links)
- Efficient, Robust and Constant-Round Distributed RSA Key Generation (Q3408194) (← links)
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems (Q3408195) (← links)
- Simplified Submission of Inputs to Protocols (Q3540053) (← links)
- (Q4638057) (← links)
- Sashimi: Cutting up CSI-FiSh Secret Keys to Produce an Actively Secure Distributed Signing Protocol (Q5041220) (← links)
- CNF-FSS and Its Applications (Q5087261) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- On the local leakage resilience of linear secret sharing schemes (Q5918308) (← links)
- Multiparty generation of an RSA modulus (Q5970801) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- High-throughput secure three-party computation with an honest majority (Q6110385) (← links)
- MPClan: protocol suite for privacy-conscious computations (Q6110388) (← links)
- Linear-time 2-party secure merge from additively homomorphic encryption (Q6168324) (← links)
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead (Q6581801) (← links)
- 3-party secure computation for RAMs: optimal and concretely efficient (Q6581802) (← links)
- Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications (Q6595675) (← links)
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus (Q6595688) (← links)
- Round-optimal, fully secure distributed key generation (Q6653011) (← links)
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions (Q6653026) (← links)
