Efficient Non-interactive Universally Composable String-Commitment Schemes

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Provable Security

• Publication date

  2009-11-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-04642-1_3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• New Constructions for Reusable, Non-erasure and Universally Composable Commitments

  2009cited by this paper
• Lossy trapdoor functions and their applications

  2008influential reference
• Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption

  2008cited by this paper
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware

  2007cited by this paper
• Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings

  2007cited by this paper
• Universally Composable Security with Global Setup

  2007cited by this paper
• Testing for Concise Representations

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

  2007cited by this paper
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

  2004influential reference
• New notions of security: achieving universal composability without trusted setup

  2004cited by this paper
• Universally Composable Commitments Using Random Oracles

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

  2004cited by this paper
• Universal Composition with Joint State

  2003cited by this paper
• Practical Verifiable Encryption and Decryption of Discrete Logarithms

  2003influential reference
• On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions

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

  2003influential reference
• Advances in Cryptology - CRYPTO 2003

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

  2002influential reference
• Advances in Cryptology — CRYPTO 2002

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

  2001influential reference
• Self Protecting Pirates and Black-Box Traitor Tracing

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

  2001influential reference
• Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor

  2001influential reference
• Universally Composable Commitments

  2001influential reference
• Nonmalleable Cryptography

  2000cited by this paper
• Advances in Cryptology-Crypto 91

  1992cited by this paper
• Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

  1991cited by this paper
• Non-malleable cryptography

  1991cited by this paper
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

  1991cited by this paper
• Public-Key Cryptography

  1991cited by this paper
• Bit commitment using pseudorandomness

  1989cited by this paper

• Lossy Trapdoor Permutations with Improved Lossiness

  2019cites this paper
• Continuous Leakage Resilient Lossy Trapdoor Functions

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

  2017cites this paper
• On the Complexity of Additively Homomorphic UC Commitments

  2016cites this paper
• Regularity of Lossy RSA on Subdomains and Its Applications

  2013cites this paper
• All-But-Many Lossy Trapdoor Functions

  2012cites this paper
• Generic Construction of GUC Secure Commitment in the KRK Model

  2012cites this paper
• Lossy Functions Do Not Amplify Well

  2012cites this paper
• Dual Projective Hashing and Its Applications - Lossy Trapdoor Functions and More

  2012cites this paper
• General Construction of Chameleon All-But-One Trapdoor Functions

  2011cites this paper
• Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security

  2011influential citation
• More Constructions of Lossy and Correlation-Secure Trapdoor Functions

  2010cites this paper
• Adaptive and composable non-interactive string-commitment protocols

  2010influential citation
• CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model

  2010cites this paper