Pages that link to "Item:Q1631337"
From MaRDI portal
The following pages link to Two-message statistically sender-private OT from LWE (Q1631337):
Displaying 37 items.
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Statistical ZAP arguments (Q2055672) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Witness indistinguishability for any single-round argument with applications to access control (Q2055687) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- UC-secure OT from LWE, revisited (Q2106640) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- Compact ring signatures from learning with errors (Q2120080) (← links)
- Multi-theorem designated-verifier NIZK for QMA (Q2120083) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Secure two-party computation in a quantum world (Q2229292) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- Secure quantum computation with classical communication (Q2695622) (← links)
- The round complexity of quantum zero-knowledge (Q2695629) (← links)
- Rate-1 quantum fully homomorphic encryption (Q2695630) (← links)
- Maliciously circuit-private multi-key FHE and MPC based on LWE (Q2701482) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Two-Round Oblivious Linear Evaluation from Learning with Errors (Q5087264) (← links)
- Algebraic restriction codes and their applications (Q6066762) (← links)
- mrNISC from LWE with polynomial modulus (Q6116180) (← links)
- Classically verifiable NIZK for QMA with preprocessing (Q6134001) (← links)
- mrNISC from LWE with polynomial modulus (Q6134835) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
- Two-round adaptively secure MPC from isogenies, LPN, or CDH (Q6157520) (← links)
- Statistically sender-private OT from LPN and derandomization (Q6163969) (← links)
- Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT (Q6488028) (← links)
- Weak zero-knowledge via the Goldreich-Levin theorem (Q6562563) (← links)
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states (Q6562577) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
