Efficient Committed Oblivious Transfer of Bit Strings

No abstract is available for this paper.

• Publication year

  2007

• Venue

  Information Security Conference

• Publication date

  2007-10-09

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-540-75496-1_9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient Two-Party Secure Computation on Committed Inputs

  2007influential reference
• Simulatable Adaptive Oblivious Transfer

  2007cited by this paper
• Efficiency Tradeoffs for Malicious Two-Party Computation

  2006cited by this paper
• A protocol issue for the malicious case of Yao's garbled circuit construction

  2006influential reference
• Public Key Cryptography - PKC 2006

  2006cited by this paper
• How To Exchange Secrets with Oblivious Transfer

  2005cited by this paper
• Practical Two-Party Computation Based on the Conditional Gate

  2004influential reference
• Efficient and Universally Composable Committed Oblivious Transfer and Applications

  2004cited by this paper
• Fairplay - Secure Two-Party Computation System

  2004cited by this paper
• Fairplay - Secure Two-Party Computation System (Awarded Best Student Paper!)

  2004cited by this paper
• Advances in Cryptology — EUROCRYPT 2003

  2003cited by this paper
• Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption

  2003cited by this paper
• Advances in Cryptology - CRYPTO 2003

  2003cited by this paper
• Advances in Cryptology - ASIACRYPT 2003

  2003cited by this paper
• Verifiable Homomorphic Oblivious Transfer and Private Equality Test

  2003influential reference
• A Length-Flexible Threshold Cryptosystem with Applications

  2003cited by this paper
• Fair Secure Two-Party Computation

  2003cited by this paper
• Efficient 1-Out-n Oblivious Transfer Schemes

  2002cited by this paper
• Advances in Cryptology — CRYPTO ’94

  2001cited by this paper
• A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

  2001influential reference
• Efficient oblivious transfer protocols

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

  2001cited by this paper
• Advances in Cryptology — ASIACRYPT 2001

  2001cited by this paper
• Multiparty Computation from Threshold Homomorphic Encryption

  2000influential reference
• A Generalisation, a Simplification and some Applications of Paillier’s Probabilistic Public-Key System

  2000cited by this paper
• Advances in Cryptology — CRYPTO 2000

  2000cited by this paper
• Advances in Cryptology — CRYPTO ’87

  2000cited by this paper
• Optimistic Fair Secure Computation

  2000cited by this paper
• Advances in Cryptology — CRYPTO’ 99

  1999cited by this paper
• Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments

  1997cited by this paper
• Information Security and Privacy

  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
• Advances in Cryptology: Eurocrypt '89

  1991cited by this paper
• Public-Key Cryptography

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

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

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

  1985cited by this paper
• Verifiable Disclosure of Secrets and Applications

  year unknowncited by this paper

• Breaking verifiability and vote privacy in CHVote

  2025cites this paper
• Iterative Oblivious Pseudo-Random Functions and Applications

  2022cites this paper
• A Study on the improvement of Computation, Communication and Security in Garbled Circuits

  2021cites this paper
• AuditShare: Sensitive Data Sharing with Reliable Leaker Identification

  2019cites this paper
• ActShare: Sensitive Data Sharing with Reliable Leaker Identification

  2019cites this paper
• Privacy Preserved Authentication: A Neural Network Approach

  2019cites this paper
• Cut-and-Choose Bilateral Oblivious Transfer

  2016cites this paper
• Efficient Server-Aided Secure Two-Party Function Evaluation with Applications to Genomic Computation

  2016cites this paper
• Fast Optimistically Fair Cut-and-Choose 2PC

  2016cites this paper
• Several Oblivious Transfer Variants in Cut-and-Choose Scenario

  2015cites this paper
• Security and efficiency analysis of the Hamming distance computation protocol based on oblivious transfer

  2015influential citation
• Generalizing Efficient Multiparty Computation

  2015cites this paper
• Cut-and-Choose Bilateral Oblivious Transfer and Its Application

  2015cites this paper
• Revisiting LEGOs: Optimizations, Analysis, and their Limit

  2015cites this paper
• Cut-and-Choose Bilateral Oblivious Transfer and Its Application in Secure Two-party Computation

  2014cites this paper
• THRIVE: threshold homomorphic encryption based secure and privacy preserving biometric verification system

  2014cites this paper
• SHADE: Secure HAmming DistancE Computation from Oblivious Transfer

  2013influential citation
• Design of advanced primitives for secure multiparty computation : special shuffles and integer comparison

  2010cites this paper
• Summary Report on Secure Computation Protocols

  2008cites this paper
• Secure and fair two-party computation

  2007cites this paper