On Robust Combiners for Oblivious Transfer and Other Primitives
From MaRDI portal
Recommendations
Cited in
(48)- Secure computation using leaky correlations (asymptotically optimal constructions)
- Proofs of Work from worst-case assumptions
- Resource-efficient OT combiners with active security
- Feebly secure cryptographic primitives
- Circuit complexity of linear functions: gate elimination and feeble security
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Combiners for functional encryption, unconditionally
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- From FE combiners to secure MPC and back
- Oblivious transfer from trapdoor permutations in minimal rounds
- Combiners for chosen-ciphertext security
- Network oblivious transfer
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
- Obfuscation combiners
- Gate elimination for linear functions and new feebly secure constructions
- Algebraic cryptography: new constructions and their security against provable break
- Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement
- A Feebly Secure Trapdoor Function
- Structural Complexity of AvgBPP
- Authenticated Byzantine generals in dual failure model
- On complete primitives for fairness
- Secure computation from leaky correlated randomness
- Error-Tolerant Combiners for Oblivious Primitives
- Robuster Combiners for Oblivious Transfer
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module
- Multi-property Preserving Combiners for Hash Functions
- OT-Combiners via Secure Computation
- On Robust Combiners for Private Information Retrieval and Other Primitives
- On the complexity of compressing obfuscation
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- Random oracle combiners: breaking the concatenation barrier for collision-resistance
- One-time programs from commodity hardware
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
- Structural complexity of AvgBPP
- Stochastic secret sharing with 1-bit shares and applications to MPC
- On central primitives for quantum cryptography with classical communication
- Amplification of non-interactive zero knowledge, revisited
- Random oracle combiners: Merkle-Damgård style
- Hybrid encryption in correlated randomness model and KEM combiners
- On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
- The complexity of explicit constructions
- Robust combiners and universal constructions for quantum cryptography
- Combining oblivious pseudorandom functions
- Robust non-interactive zero-knowledge combiners
- On complete one-way functions
- Robust multi-property combiners for hash functions
This page was built for publication: On Robust Combiners for Oblivious Transfer and Other Primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385724)
