Efficient and round-optimal oblivious transfer and commitment with adaptive security
From MaRDI portal
Publication:2691588
DOI10.1007/978-3-030-64840-4_10OpenAlexW3028977572MaRDI QIDQ2691588
Publication date: 29 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_10
Related Items (10)
Universally composable subversion-resilient cryptography ⋮ Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Triply adaptive UC NIZK ⋮ Reverse firewalls for oblivious transfer extension and applications to zero-knowledge ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Reverse firewalls for adaptively secure MPC without setup ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ GUC-secure commitments via random oracles: new impossibility and feasibility ⋮ Endemic oblivious transfer via random oracles, revisited ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-round multiparty secure computation minimizing public key operations
- Two-round adaptively secure multiparty computation from standard assumptions
- The wonderful world of global random oracles
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Equational security proofs of oblivious transfer protocols
- Efficient adaptively secure zero-knowledge from garbled circuits
- Blazing fast OT for three-round UC OT extension
- Two-round oblivious transfer from CDH or LPN
- On Black-Box Complexity of Universally Composable Security in the CRS Model
- SPHF-Friendly Non-interactive Commitments
- The Simplest Protocol for Oblivious Transfer
- Actively Secure OT Extension with Optimal Overhead
- Universally composable two-party and multi-party secure computation
- Non-interactive and reusable non-malleable commitment schemes
- A Framework for Efficient and Composable Oblivious Transfer
- Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS
- Equivocating Yao
- An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Non-Interactive Secure Computation Based on Cut-and-Choose
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Better Two-Round Adaptive Multi-party Computation
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
- Removing Erasures with Explainable Hash Proof Systems
This page was built for publication: Efficient and round-optimal oblivious transfer and commitment with adaptive security
