A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
From MaRDI portal
Publication:4412793
DOI10.1007/3-540-36178-2_8zbMath1065.94545OpenAlexW1561877077MaRDI QIDQ4412793
Eiichiro Fujisaki, Ivan B. Damgård
Publication date: 16 July 2003
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-36178-2_8
Related Items (45)
Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ Provably secure and pairing-based strong designated verifier signature scheme with message recovery ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ A verifiable secret shuffle of homomorphic encryptions ⋮ Signatures and Efficient Proofs on Committed Graphs and NP-Statements ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ Towards practical homomorphic time-lock puzzles: applicability and verifiability ⋮ Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions ⋮ Succinct Diophantine-satisfiability arguments ⋮ Generalized proofs of knowledge with fully dynamic setup ⋮ Secure Authenticated Comparisons ⋮ Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ A Framework for Constructing Convertible Undeniable Signatures ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ Simplified Threshold RSA with Adaptive and Proactive Security ⋮ Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries ⋮ Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ ⋮ Zero-Knowledge Authenticated Order Queries and Order Statistics on a List ⋮ Recovering Lost Device-Bound Credentials ⋮ On the Portability of Generalized Schnorr Proofs ⋮ Transparent SNARKs from DARK compilers ⋮ Bandwidth-efficient threshold EC-DSA ⋮ Efficient range proofs with transparent setup from bounded integer commitments ⋮ New RSA-Based (Selectively) Convertible Undeniable Signature Schemes ⋮ Filling the gap between voters and cryptography in e-voting ⋮ How to Prove Knowledge of Small Secrets ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Encryption Switching Protocols ⋮ How to obtain full privacy in auctions ⋮ Efficient, Robust and Constant-Round Distributed RSA Key Generation ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ A new scale-invariant homomorphic encryption scheme ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics ⋮ Augmented Oblivious Polynomial Evaluation Protocol and Its Applications
This page was built for publication: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
