On Black-Box Complexity of Universally Composable Security in the CRS Model

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Journal of Cryptology

• Publication date

  2015-11-29

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/s00145-019-09326-y
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On Black-Box Complexity of Universally Composable Security in the CRS Model

  2019influential reference
• A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models

  2017cited by this paper
• Founding Cryptography on Oblivious Transfer

  2016cited by this paper
• One-Sided Adaptively Secure Two-Party Computation

  2014cited by this paper
• Universally Composable Oblivious Transfer Based on a Variant of LPN

  2014cited by this paper
• Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments

  2013influential reference
• Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS

  2013influential reference
• Analysis and Improvement of Lindell's UC-Secure Commitment Schemes

  2013cited by this paper
• Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

  2013cited by this paper
• Constructing Non-malleable Commitments: A Black-Box Approach

  2012cited by this paper
• Black-Box Constructions of Composable Protocols without Set-Up

  2012cited by this paper
• Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions

  2012cited by this paper
• A Unified Framework for UC from Only OT

  2012cited by this paper
• Highly-Efficient Universally-Composable Commitments based on the DDH Assumption

  2011influential reference
• Black-Box Constructions of Protocols for Secure Computation

  2011cited by this paper
• On the Necessary and Sufficient Assumptions for UC Computation

  2010cited by this paper
• A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security

  2010influential reference
• Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer

  2009cited by this paper
• Adaptively Secure Two-Party Computation with Erasures

  2009cited by this paper
• Improved Non-committing Encryption with Applications to Adaptively Secure Protocols

  2009influential reference
• Black-Box Constructions of Two-Party Protocols from One-Way Functions

  2009cited by this paper
• Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

  2009cited by this paper
• A unified framework for concurrent security: universal composability from stand-alone non-malleability

  2009cited by this paper
• Simple, Black-Box Constructions of Adaptively Secure Protocols

  2009influential reference
• Founding Cryptography on Oblivious Transfer - Efficiently

  2008influential reference
• Semi-honest to Malicious Oblivious Transfer - The Black-Box Way

  2008influential reference
• Universally Composable Security with Global Setup

  2007cited by this paper
• Cryptography from Sunspots: How to Use an Imperfect Reference String

  2007cited by this paper
• Testing for Concise Representations

  2007cited by this paper
• Concurrent Composition of Secure Protocols in the Timing Model

  2007cited by this paper
• Black-box constructions for secure computation

  2006cited by this paper
• A simple recursive numerical method for Bermudan option pricing under Lévy processes

  2006influential reference
• How To Exchange Secrets with Oblivious Transfer

  2005cited by this paper
• Smooth Projective Hashing and Two-Message Oblivious Transfer

  2005cited by this paper
• Universally composable protocols with relaxed set-up assumptions

  2004cited by this paper
• Round-Optimal Secure Two-Party Computation

  2004cited by this paper
• Non-interactive and reusable non-malleable commitment schemes

  2003influential reference
• General Composition and Universal Composability in Secure Multiparty Computation

  2003cited by this paper
• On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions

  2003cited by this paper
• Universally composable two-party and multi-party secure computation

  2002cited by this paper
• Universally composable security: a new paradigm for cryptographic protocols

  2001cited by this paper
• Efficient oblivious transfer protocols

  2001influential reference
• Universally Composable Commitments

  2001cited by this paper
• Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor

  2001cited by this paper
• The Foundations of Cryptography - Volume 1, Basic Techniques.

  2001cited by this paper
• The relationship between public key encryption and oblivious transfer

  2000cited by this paper
• Improved Non-committing Encryption Schemes Based on a General Complexity Assumption

  2000influential reference
• Foundations of Cryptography: Basic Tools

  2000cited by this paper
• Adaptively secure multi-party computation

  1996influential reference
• Secure Computation (Abstract)

  1991cited by this paper
• Foundations of Secure Interactive Computing

  1991cited by this paper
• Founding crytpography on oblivious transfer

  1988cited by this paper
• Limits on the provable consequences of one-way permutations

  1988cited by this paper
• How to play ANY mental game

  1987cited by this paper
• How to generate and exchange secrets

  1986cited by this paper
• A randomized protocol for signing contracts

  1985cited by this paper
• SRI International

  1982cited by this paper
• How to share a secret

  1979cited by this paper

• From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-theoretic

  2022cites this paper
• Two-Round Adaptively Secure MPC from Isogenies, LPN, or CDH

  2021cites this paper
• Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (Timed) Assumptions

  2021influential citation
• Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model

  2020cites this paper
• Improved Black-Box Constructions of Composable Secure Computation

  2020cites this paper
• Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security

  2020cites this paper
• On Black-Box Complexity of Universally Composable Security in the CRS Model

  2019cites this paper
• Concurrently Composable Security with Shielded Super-Polynomial Simulators

  2017cites this paper
• A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models

  2017cites this paper
• Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security

  2017cites this paper
• Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model

  2017cites this paper