A statistically-hiding integer commitment scheme based on groups with hidden order
From MaRDI portal
Recommendations
- A cryptographic primitive based on hidden-order groups
- Cryptographic primitives based on groups on hidden order
- Hidden-Vector Encryption with Groups of Prime Order
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- On group-characterizability of homomorphic secret sharing schemes
- Anonymous HIBE with short ciphertexts: full security in prime order groups
- Secret sharing using non-commutative groups and the shortlex order
- A verifiable secret sharing scheme using non-abelian groups
Cited in
(62)- Filling the gap between voters and cryptography in e-voting
- Provably secure and pairing-based strong designated verifier signature scheme with message recovery
- Transparent SNARKs from DARK compilers
- Bandwidth-efficient threshold EC-DSA
- Efficient range proofs with transparent setup from bounded integer commitments
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Time- and space-efficient arguments from groups of unknown order
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Succinct Diophantine-satisfiability arguments
- Generalized proofs of knowledge with fully dynamic setup
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- Recovering lost device-bound credentials
- 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
- Group to group commitments do not shrink
- Signatures and efficient proofs on committed graphs and NP-statements
- Partial bits exposure attacks on a new commitment scheme based on the Zagier polynomial
- Secure authenticated comparisons
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- Efficiency limitations for -protocols for group homomorphisms
- Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
- Efficient Binary Conversion for Paillier Encrypted Values
- Simplified Threshold RSA with Adaptive and Proactive Security
- BGN Authentication and Its Extension to Convey Message Commitments
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
- On the Portability of Generalized Schnorr Proofs
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- Proving in zero-knowledge that a number is the product of two safe primes
- A framework for constructing convertible undeniable signatures
- Short zero-knowledge proof of knowledge for lattice-based commitment
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- How to obtain full privacy in auctions
- Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
- Removing the strong RSA assumption from arguments over the integers
- Augmented oblivious polynomial evaluation protocol and its applications
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- A verifiable secret shuffle of homomorphic encryptions
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Zero-knowledge arguments for subverted RSA groups
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
- 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 -protocols
- Towards practical homomorphic time-lock puzzles: applicability and verifiability
- Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
- Zero-knowledge functional elementary databases
- Towards zero knowledge argument for double discrete logarithm with constant cost
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- On soundness notions for interactive oracle proofs
- An improved threshold homomorphic cryptosystem based on class groups
- Efficient succinct zero-knowledge arguments in the CL framework
- Traceable verifiable random functions
- An improved threshold homomorphic cryptosystem based on class groups
- Inner-product commitments over integers with applications to succinct arguments
- Space-deniable proofs
- Two-round 2PC ECDSA at the cost of 1 OLE: applications to embedded cryptocurrency wallets
- General techniques for building SNARKs over the integers
- Succinctly verifiable computation over additively-homomorphically encrypted data: making privacy-preserving blueprints practical
- A new scale-invariant homomorphic encryption scheme
This page was built for publication: A statistically-hiding integer commitment scheme based on groups with hidden order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412793)
