Concurrent oblivious transfer

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Proceedings 41st Annual Symposium on Foundations of Computer Science

• Publication date

  2000-11-12

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/SFCS.2000.892120
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Note on the Round-Complexity of Concurrent Zero-Knowledge

  2000cited by this paper
• Efficient Concurrent Zero-Knowledge in the Auxiliary String Model

  2000cited by this paper
• Oblivious transfer and polynomial evaluation

  1999cited by this paper
• On Formal Models for Secure Key Exchange

  1999cited by this paper
• Resettable Zero-Knowledge

  1999cited by this paper
• On Concurrent Zero-Knowledge with Pre-processing

  1999cited by this paper
• Public-key cryptography and password protocols: the multi-user case

  1999cited by this paper
• Lower Bounds for Oblivious Transfer Reductions

  1999cited by this paper
• Conditional Oblivious Transfer and Timed-Release Encryption

  1999cited by this paper
• On the Concurrent Composition of Zero-Knowledge Proofs

  1999cited by this paper
• Abuse-Free Optimistic Contract Signing

  1999cited by this paper
• Public-key cryptography and password protocols

  1998cited by this paper
• On the Foundations of Oblivious Transfer

  1998cited by this paper
• Proceedings of the thirtieth annual ACM symposium on Theory of computing

  1998cited by this paper
• Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints

  1998cited by this paper
• Lower bounds for zero knowledge on the Internet

  1998cited by this paper
• A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract)

  1998cited by this paper
• On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions

  1998cited by this paper
• Open Key Exchange: How to Defeat Dictionary Attacks Without Encrypting Public Keys

  1997cited by this paper
• Equivocable Oblivious Transfer

  1996cited by this paper
• Committed Oblivious Transfer and Private Multi-Party Computation

  1995cited by this paper
• Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

  1994cited by this paper
• Entity Authentication and Key Distribution

  1993cited by this paper
• Authentication and authenticated key exchanges

  1992cited by this paper
• How to Break a "Secure" Oblivious Transfer Protocol

  1992influential reference
• Non-Malleable Cryptography (Extended Abstract)

  1991cited by this paper
• Systematic Design of Two-Party Authentication Protocols

  1991cited by this paper
• Non-malleable cryptography

  1991cited by this paper
• Security, fault tolerance, and communication complexity in distributed systems

  1990cited by this paper
• Witness indistinguishable and witness hiding protocols

  1990cited by this paper
• Public-Randomness in Public Key Cryptography

  1990cited by this paper
• Verifiable Disclosure of Secrets and Applications (Abstract)

  1990cited by this paper
• Noninteractive oblivious transfer

  1990cited by this paper
• Minimum Resource Zero-Knowledge Proofs (Extended Abstract)

  1989cited by this paper
• A hard-core predicate for all one-way functions

  1989cited by this paper
• Minimum resource zero-knowledge proofs (extended abstracts)

  1989cited by this paper
• Non-Interactive Oblivious Transfer and Applications

  1989cited by this paper
• On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs

  1989cited by this paper
• Founding crytpography on oblivious transfer

  1988cited by this paper
• Equivalence Between Two Flavours of Oblivious Transfers

  1987cited by this paper
• Information theoretic reductions among disclosure problems

  1986cited by this paper
• All-or-Nothing Disclosure of Secrets

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

  1985cited by this paper
• Using encryption for authentication in large networks of computers

  1978cited by this paper

• Universally Composable Security

  2020cites this paper
• Black-Box Constructions of Bounded-Concurrent Secure Computation

  2020cites this paper
• A New Approach to Black-Box Concurrent Secure Computation

  2018cites this paper
• Confidentiality Protection of Digital Health Records in Cloud Computing

  2016cites this paper
• Concurrent Secure Computation via Non-Black Box Simulation

  2015cites this paper
• Cross-Domain Secure Computation

  2014cites this paper
• Constant-round protocols of stronger security via relaxed set-up assumptions

  2013cites this paper
• Constant-round protocols of stronger security via relaxed set-up assumptions

  2013cites this paper
• Positive Results for Concurrently Secure Computation in the Plain Model

  2012cites this paper
• Impossibility Results for Static Input Secure Computation

  2012cites this paper
• Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security

  2012cites this paper
• How to retrieve priced data

  2010cites this paper
• Concurrent Knowledge Extraction in Public-Key Models

  2010cites this paper
• Concurrent Knowledge Extraction in the Public-Key Model

  2009cites this paper
• Robust t-out-of-n oblivious transfer mechanism based on CRT

  2009cites this paper
• Summary Report on Secure Computation Protocols

  2008cites this paper
• Lower Bounds and Impossibility Results for Concurrent Self Composition

  2008influential citation
• Independent Oblivious Transfer

  2007cites this paper
• Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free

  2007cites this paper
• Universally Composable Oblivious Transfer in the Multi-party Setting

  2006cites this paper
• Concurrent Non-Malleable Zero Knowledge

  2006cites this paper
• Oblivious Polynomial Evaluation

  2006cites this paper
• Protocols for Bounded-Concurrent Secure Two-Party Computation

  2006cites this paper
• On the composition of authenticated Byzantine Agreement

  2006cites this paper
• CHOOSING T-OUT-OF-N SECRETS BY OBLIVIOUS TRANSFER

  2006cites this paper
• PROVI . 1 First Summary Report on Two-Party Protocols

  2005cites this paper
• Concurrent general composition of secure protocols in the timing model

  2005cites this paper
• You Can Prove So Many Things in Zero-Knowledge

  2005cites this paper
• Universally Composable Committed Oblivious Transfer and Multi-Party Computation Assuming Only Basic Black-Box Primitives

  2004cites this paper
• Efficient and Universally Composable Committed Oblivious Transfer and Applications

  2004cites this paper
• Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters

  2004cites this paper
• Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters

  2004cites this paper
• Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications

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

  2003cites this paper
• Bounded-concurrent secure two-party computation without setup assumptions

  2003influential citation
• Advances in Cryptology — EUROCRYPT 2003

  2003influential citation
• On the composition of authenticated byzantine agreement

  2002cites this paper
• Universally composable two-party and multi-party secure computation

  2002cites this paper
• Oblivious Transfer in the Bounded Storage Model

  2001cites this paper
• Universally composable security: a new paradigm for cryptographic protocols

  2001cites this paper
• Second Summary Report on Two-party Protocols Second Summary Report on Two-party Protocols

  year unknowncites this paper