Pages that link to "Item:Q4412793"
From MaRDI portal
The following pages link to A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order (Q4412793):
Displaying 49 items.
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- Filling the gap between voters and cryptography in e-voting (Q1028368) (← links)
- Provably secure and pairing-based strong designated verifier signature scheme with message recovery (Q1637871) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- Bandwidth-efficient threshold EC-DSA (Q2055695) (← links)
- Efficient range proofs with transparent setup from bounded integer commitments (Q2056793) (← links)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q2145404) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- Succinct Diophantine-satisfiability arguments (Q2691605) (← links)
- Generalized proofs of knowledge with fully dynamic setup (Q2695646) (← links)
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ (Q2790061) (← links)
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List (Q2794500) (← links)
- Recovering Lost Device-Bound Credentials (Q2794506) (← links)
- How to Prove Knowledge of Small Secrets (Q2829957) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- Encryption Switching Protocols (Q2835592) (← links)
- Signatures and Efficient Proofs on Committed Graphs and NP-Statements (Q2948189) (← links)
- Secure Authenticated Comparisons (Q3011317) (← links)
- Efficient, Robust and Constant-Round Distributed RSA Key Generation (Q3408194) (← links)
- Efficiency Limitations for Σ-Protocols for Group Homomorphisms (Q3408215) (← links)
- Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use (Q3503874) (← links)
- Efficient Binary Conversion for Paillier Encrypted Values (Q3593115) (← links)
- Simplified Threshold RSA with Adaptive and Proactive Security (Q3593121) (← links)
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries (Q3600327) (← links)
- On the Portability of Generalized Schnorr Proofs (Q3627449) (← links)
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes (Q3637135) (← links)
- A Framework for Constructing Convertible Undeniable Signatures (Q4933212) (← links)
- Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment (Q5041225) (← links)
- Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model (Q5087275) (← links)
- How to obtain full privacy in auctions (Q5492128) (← links)
- Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack (Q5738887) (← links)
- Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) (← links)
- Augmented Oblivious Polynomial Evaluation Protocol and Its Applications (Q5862667) (← links)
- Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q6041582) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q6063130) (← links)
- Zero-knowledge arguments for subverted RSA groups (Q6088994) (← links)
- Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs (Q6108830) (← links)
- On time-lock cryptographic assumptions in abelian hidden-order groups (Q6157523) (← links)
- An algebraic framework for silent preprocessing with trustless setup and active security (Q6166960) (← links)
- Vector commitments over rings and compressed \(\varSigma \)-protocols (Q6169352) (← links)
- Zero-knowledge functional elementary databases (Q6604931) (← links)
- Towards zero knowledge argument for double discrete logarithm with constant cost (Q6615217) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
- On soundness notions for interactive oracle proofs (Q6655868) (← links)
- An improved threshold homomorphic cryptosystem based on class groups (Q6660542) (← links)
- Efficient succinct zero-knowledge arguments in the CL framework (Q6665550) (← links)
