Pages that link to "Item:Q3600240"
From MaRDI portal
The following pages link to A Framework for Efficient and Composable Oblivious Transfer (Q3600240):
Displaying 50 items.
- Polly cracker, revisited (Q285245) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Generating shorter bases for hard random lattices (Q537918) (← links)
- Cryptanalysis of a homomorphic encryption scheme (Q680918) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
- STP-LWE: A variant of learning with error for a flexible encryption (Q1718158) (← links)
- All-but-many encryption (Q1747665) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE (Q2001181) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions (Q2025352) (← links)
- CCA-security from adaptive all-but-one lossy trapdoor functions (Q2049981) (← links)
- Blazing fast OT for three-round UC OT extension (Q2055696) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- Compact, efficient and UC-secure isogeny-based oblivious transfer (Q2056684) (← links)
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions (Q2056693) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← links)
- On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory (Q2096518) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- On the round complexity of secure quantum computation (Q2120084) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- Counterexamples to new circular security assumptions underlying iO (Q2128580) (← links)
- More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
- Everlasting UC commitments from fully malicious PUFs (Q2155992) (← links)
- Logarithmic-size ring signatures with tight security from the DDH assumption (Q2167754) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- Lattice trapdoors and IBE from middle-product LWE (Q2175903) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- Channels of small log-ratio leakage and characterization of two-party differentially private computation (Q2175926) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
