Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems

No abstract is available for this paper.

• Publication year

  2023

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-031-50594-2_10
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Zero-Knowledge Protocols for the Subset Sum Problem from MPC-in-the-Head with Rejection

  2022cited by this paper
• Efficient Lifting for Shorter Zero-Knowledge Proofs and Post-Quantum Signatures

  2022cited by this paper
• Improved Classical and Quantum Algorithms for Subset-Sum

  2020cited by this paper
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography

  2020cited by this paper
• Practical Product Proofs for Lattice Commitments

  2020cited by this paper
• More Efficient Commitments from Structured Lattice Assumptions

  2018cited by this paper
• Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures

  2018cited by this paper
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings

  2015cited by this paper
• Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise

  2012cited by this paper
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum

  2010cited by this paper
• Zero-Knowledge Proofs from Secure Multiparty Computation

  2009cited by this paper
• On the Provable Security of an Efficient RSA-Based Pseudorandom Generator

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

  2002cited by this paper
• The Rise and Fall of Knapsack Cryptosystems

  1998cited by this paper
• A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost

  1997cited by this paper
• A public-key cryptosystem with worst-case/average-case equivalence

  1997influential reference
• Algorithms for quantum computation: discrete logarithms and factoring

  1994cited by this paper
• Improved low-density subset sum algorithms

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

  1991cited by this paper
• Uses of randomness in algorithms and protocols

  1990cited by this paper
• A discrete logarithm implementation of perfect zero-knowledge blobs

  1990cited by this paper
• Efficient cryptographic schemes provably as secure as subset sum

  1989cited by this paper
• The Knowledge Complexity of Interactive Proof Systems

  1989cited by this paper
• Minimum Disclosure Proofs of Knowledge

  1988cited by this paper
• Coin flipping by telephone a protocol for solving impossible problems

  1983cited by this paper
• Fast Probabilistic Algorithms for Verification of Polynomial Identities

  1980cited by this paper
• Probabilistic algorithms for sparse polynomials

  1979cited by this paper
• Symbolic and Algebraic Computation, EUROSAM '79, An International Symposiumon Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings

  1979cited by this paper
• Hiding information and signatures in trapdoor knapsacks

  1978cited by this paper

• “Check-Before-you-Solve”: Verifiable Time-Lock Puzzles

  2025cites this paper
• Blind ECDSA from the ECDSA Assumption

  2025cites this paper