(Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
From MaRDI portal
Publication:2423844
DOI10.1007/s00145-018-9288-xzbMath1434.94062OpenAlexW2169592765MaRDI QIDQ2423844
Seung Geol Choi, Dominique Schröder, Hong-Sheng Zhou, Arkady Yerukhimovich, Jonathan N. Katz
Publication date: 20 June 2019
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-018-9288-x
Cites Work
- Bit commitment using pseudorandomness
- General composition and universal composability in secure multiparty computation
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- Security against covert adversaries: Efficient protocols for realistic adversaries
- On the limitations of universally composable two-party computation without set-up assumptions
- Verifiable Random Functions from Standard Assumptions
- Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
- Secure Set Intersection with Untrusted Hardware Tokens
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
- Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
- Constructing Verifiable Random Functions with Large Input Spaces
- Universally composable two-party and multi-party secure computation
- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
- One-Time Programs
- Founding Cryptography on Oblivious Transfer – Efficiently
- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
- Universally Composable Multiparty Computation with Partially Isolated Parties
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Foundations of Cryptography
- Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens
- A unified framework for concurrent security
- Obtaining Universally Compoable Security: Towards the Bare Bones of Trust
- Advances in Cryptology - CRYPTO 2003
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- Public Key Cryptography - PKC 2005
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
