scientific article; zbMATH DE number 1088224
From MaRDI portal
Publication:4364540
Recommendations
Cited in
(70)- Filling the gap between voters and cryptography in e-voting
- On the tightness of forward-secure signature reductions
- On relationships between statistical zero-knowledge proofs
- Transparent SNARKs from DARK compilers
- Efficient range proofs with transparent setup from bounded integer commitments
- Two-sided malicious security for private intersection-sum with cardinality
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- The RSA group is pseudo-free
- Efficient RSA key generation and threshold Paillier in the two-party setting
- How (not) to design strong-RSA signatures
- On the security of Miyaji et al. group signature scheme
- Proxy signature scheme using self-certified public keys
- Succinct Diophantine-satisfiability arguments
- Cryptographic assumptions: a position paper
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
- Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
- Encryption switching protocols
- Zero-knowledge for multivariate polynomials
- 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
- Zero-knowledge proof protocol of the roots of polynomial functions
- A general, flexible and efficient proof of inclusion and exclusion
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- Efficiency limitations for -protocols for group homomorphisms
- Property-Based Attestation without a Trusted Third Party
- Privacy-Preserving Similarity Evaluation and Application to Remote Biometrics Authentication
- The polynomial composition problem in \((\mathbb Z/n\mathbb Z)[X]\)
- Efficient Binary Conversion for Paillier Encrypted Values
- Programmable Hash Functions and Their Applications
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
- Efficient Protocols for Set Membership and Range Proofs
- Statistically Hiding Sets
- On the Portability of Generalized Schnorr Proofs
- A Commitment-Consistent Proof of a Shuffle
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
- Programmable hash functions and their applications
- A framework for constructing convertible undeniable signatures
- A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract)
- 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
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
- A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
- Removing the strong RSA assumption from arguments over the integers
- Augmented oblivious polynomial evaluation protocol and its applications
- Breaking RSA Generically Is Equivalent to Factoring
- Advances in Cryptology - ASIACRYPT 2003
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- A verifiable secret shuffle of homomorphic encryptions
- Privacy-preserving blueprints
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Zero-knowledge arguments for subverted RSA groups
- Universally composable -protocols in the global random-oracle model
- Anonymous counting tokens
- New SIDH countermeasures for a more efficient key exchange
- \textsf{FESTA}: fast encryption from supersingular torsion attacks
- Zero-knowledge functional elementary databases
- Efficient updatable public-key encryption from lattices
- Towards zero knowledge argument for double discrete logarithm with constant cost
- DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5KB proofs from falsifiable assumptions
- CDLS: proving knowledge of committed discrete logarithms with soundness
- Inner-product commitments over integers with applications to succinct arguments
- Malicious private set union with two-sided output
- Two-round 2PC ECDSA at the cost of 1 OLE: applications to embedded cryptocurrency wallets
- On the amortized complexity of zero-knowledge protocols
- A new scale-invariant homomorphic encryption scheme
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364540)
