Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS
From MaRDI portal
Publication:4916002
DOI10.1007/978-3-642-36362-7_6zbMath1314.94061OpenAlexW322359122MaRDI QIDQ4916002
Hoeteck Wee, Seung Geol Choi, Hong-Sheng Zhou, Jonathan N. Katz
Publication date: 19 April 2013
Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_6
Related Items
Two-round adaptively secure multiparty computation from standard assumptions, Generalizing Efficient Multiparty Computation, Adaptive Oblivious Transfer and Generalization, Structure-Preserving Smooth Projective Hashing, Two-round adaptively secure MPC from isogenies, LPN, or CDH, Constant-round adaptive zero-knowledge proofs for NP, Efficient and round-optimal oblivious transfer and commitment with adaptive security, On the (Ir)replaceability of global setups, or how (not) to use a global ledger, Removing Erasures with Explainable Hash Proof Systems, Generic Construction of UC-Secure Oblivious Transfer, On black-box complexity of universally composable security in the CRS model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth projective hashing and two-message oblivious transfer
- On the limitations of universally composable two-party computation without set-up assumptions
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
- Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
- Universally composable two-party and multi-party secure computation
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Universally-Composable Two-Party Computation in Two Rounds
- Adaptively Secure Two-Party Computation with Erasures
- Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- The IPS Compiler: Optimizations, Variants and Concrete Efficiency
- Advances in Cryptology – CRYPTO 2004
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
- Advances in Cryptology - CRYPTO 2003
- Efficient Two-Party Secure Computation on Committed Inputs
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient Fully-Simulatable Oblivious Transfer
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Theory of Cryptography
