Pages that link to "Item:Q2817650"
From MaRDI portal
The following pages link to A minimal model for secure computation (extended abstract) (Q2817650):
Displaying 50 items.
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- Invited talk: Resilient distributed algorithms (Q831782) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Perfect secure computation in two rounds (Q1629404) (← links)
- On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate (Q1629415) (← links)
- Best possible information-theoretic MPC (Q1631330) (← links)
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ (Q1633461) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back (Q1698392) (← links)
- Optimal linear multiparty conditional disclosure of secrets protocols (Q1710680) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- A note on secure multiparty computation via higher residue symbols (Q2040551) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- Dynamic ad hoc clock synchronization (Q2056800) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← links)
- Stacked garbling. Garbled circuit proportional to longest execution path (Q2096548) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions (Q2128566) (← links)
- Evolving homomorphic secret sharing for hierarchical access structures (Q2128751) (← links)
- Upslices, downslices, and secret-sharing with complexity of \(1.5^n\) (Q2129013) (← links)
- Quadratic secret sharing and conditional disclosure of secrets (Q2129018) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation (Q2179390) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Oblivious polynomial evaluation and oblivious neural learning (Q2566001) (← links)
- Cryptography from one-way communication: on completeness of finite channels (Q2691601) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Multi-party PSM, revisited: improved communication and unbalanced communication (Q2697857) (← links)
- From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back (Q2799090) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Compiling Information-Flow Security to Minimal Trusted Computing Bases (Q3000581) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Founding Cryptography on Tamper-Proof Hardware Tokens (Q3408202) (← links)
- Statistical Randomized Encodings: A Complexity Theoretic View (Q3448769) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- Interleaved Group Products (Q4634030) (← links)
- Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC (Q5002786) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- (Q5090374) (← links)
- (Q5090444) (← links)
- (Q5090982) (← links)
- Some Open Problems in Information-Theoretic Cryptography (Q5136294) (← links)
- Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations (Q5149756) (← links)
- Perfect Secure Computation in Two Rounds (Q5149757) (← links)