Fast batch verification for modular exponentiation and digital signatures
From MaRDI portal
Recommendations
Cited in
(54)- Strongly secure certificateless signature scheme supporting batch verification
- Batch verification of short signatures
- Delegating a product of group exponentiations with application to signature schemes
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Partially structure-preserving signatures: lower bounds, constructions and more
- Comments on efficient batch verification test for digital signatures based on elliptic curves
- Improved signature schemes for secure multi-party computation with certified inputs
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Speeding-up verification of digital signatures
- Security reconsideration of the Huang-Wang nominative signature
- Improved DSA variant for batch verification
- A new batch verifying scheme for identifying illegal signatures
- Simple and efficient batch verification techniques for verifiable delay functions
- scientific article; zbMATH DE number 1583769 (Why is no real title available?)
- Secure application execution in mobile devices
- Accelerating oblivious transfer with batch multi-exponentiation
- Really fast syndrome-based hashing
- Batch Computations Revisited: Combining Key Computations and Batch Verifications
- Toward compact public key encryption based on CDH assumption via extended twin DH assumption
- A secure and efficient proof of integer in an interval range
- ID-based authenticated group key agreement from bilinear maps
- Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
- Practical Short Signature Batch Verification
- On the security of RSA screening
- scientific article; zbMATH DE number 1955792 (Why is no real title available?)
- scientific article; zbMATH DE number 2044525 (Why is no real title available?)
- Applied Cryptography and Network Security
- Algebraic (trapdoor) one-way functions: constructions and applications
- Simplified small exponent test for batch verification
- Improved Harn Batch Digital Signature Algorithm for Multicast Authentication
- Faster Batch Verification of Standard ECDSA Signatures Using Summation Polynomials
- Batch Verification of Short Signatures
- Finding Invalid Signatures in Pairing-Based Batches
- Batch verification for digital signatures
- Cut down the tree to achieve constant complexity in divisible e-cash
- Removing the strong RSA assumption from arguments over the integers
- Practical statistically-sound proofs of exponentiation in any group
- A composable security treatment of ECVRF and batch verifications
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
- Group testing aggregate signatures with soundness
- Efficient Unique Ring Signature for Blockchain Privacy Protection
- Bicorn: an optimistically efficient distributed randomness beacon
- Efficient succinct zero-knowledge arguments in the CL framework
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- Accountable multi-signatures with constant size public keys
- Tiresias: large scale, UC-secure threshold Paillier
- DahLIAS: discrete logarithm-based interactive aggregate signatures
- Efficient maliciously secure oblivious exponentiations
- Special soundness revisited
- Special soundness in the random oracle model
- Practical batch proofs of exponentiation
- Batch subgroup membership testing on pairing-friendly curves
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
- Improved batch exponentiation
This page was built for publication: Fast batch verification for modular exponentiation and digital signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249641)
