The following pages link to (Q4364540):
Displaying 50 items.
- Programmable hash functions and their applications (Q434345) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- On the amortized complexity of zero-knowledge protocols (Q744603) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- Filling the gap between voters and cryptography in e-voting (Q1028368) (← links)
- On the tightness of forward-secure signature reductions (Q1715854) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- Efficient range proofs with transparent setup from bounded integer commitments (Q2056793) (← links)
- Two-sided malicious security for private intersection-sum with cardinality (Q2102051) (← links)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q2145404) (← links)
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms (Q2167716) (← links)
- The RSA group is pseudo-free (Q2267366) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- How (not) to design strong-RSA signatures (Q2430687) (← links)
- On the security of Miyaji et al. group signature scheme (Q2570798) (← links)
- Proxy signature scheme using self-certified public keys (Q2571983) (← links)
- Succinct Diophantine-satisfiability arguments (Q2691605) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security (Q2822671) (← 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)
- Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial (Q2980866) (← links)
- Secure Authenticated Comparisons (Q3011317) (← links)
- A General, Flexible and Efficient Proof of Inclusion and Exclusion (Q3073693) (← links)
- Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes (Q3104713) (← links)
- Efficient, Robust and Constant-Round Distributed RSA Key Generation (Q3408194) (← links)
- Efficiency Limitations for Σ-Protocols for Group Homomorphisms (Q3408215) (← links)
- Property-Based Attestation without a Trusted Third Party (Q3540143) (← links)
- Privacy-Preserving Similarity Evaluation and Application to Remote Biometrics Authentication (Q3540937) (← links)
- Efficient Binary Conversion for Paillier Encrypted Values (Q3593115) (← links)
- Programmable Hash Functions and Their Applications (Q3600211) (← links)
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries (Q3600327) (← links)
- Efficient Protocols for Set Membership and Range Proofs (Q3600378) (← links)
- Statistically Hiding Sets (Q3623038) (← links)
- On the Portability of Generalized Schnorr Proofs (Q3627449) (← links)
- A Commitment-Consistent Proof of a Shuffle (Q3634509) (← links)
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes (Q3637135) (← links)
- A Framework for Constructing Convertible Undeniable Signatures (Q4933212) (← links)
- A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract) (Q4933219) (← 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)
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles (Q5502754) (← links)
- A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem (Q5504640) (← links)
- Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) (← links)
- Augmented Oblivious Polynomial Evaluation Protocol and Its Applications (Q5862667) (← links)
- Breaking RSA Generically Is Equivalent to Factoring (Q5901923) (← 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)
