scientific article; zbMATH DE number 1303126
From MaRDI portal
Publication:4249641
Recommendations
Cited in
(44)- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
- Speeding-up verification of digital signatures
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
- Group testing aggregate signatures with soundness
- Faster Batch Verification of Standard ECDSA Signatures Using Summation Polynomials
- A secure and efficient proof of integer in an interval range
- Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
- A composable security treatment of ECVRF and batch verifications
- Batch verification of short signatures
- scientific article; zbMATH DE number 1955792 (Why is no real title available?)
- scientific article; zbMATH DE number 2044525 (Why is no real title available?)
- Bicorn: an optimistically efficient distributed randomness beacon
- Practical Short Signature Batch Verification
- Batch Computations Revisited: Combining Key Computations and Batch Verifications
- scientific article; zbMATH DE number 1583769 (Why is no real title available?)
- Secure application execution in mobile devices
- Improved batch exponentiation
- Batch Verification of Short Signatures
- Applied Cryptography and Network Security
- Delegating a product of group exponentiations with application to signature schemes
- A new batch verifying scheme for identifying illegal signatures
- Comments on efficient batch verification test for digital signatures based on elliptic curves
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Security reconsideration of the Huang-Wang nominative signature
- Partially structure-preserving signatures: lower bounds, constructions and more
- Improved signature schemes for secure multi-party computation with certified inputs
- Really fast syndrome-based hashing
- Practical statistically-sound proofs of exponentiation in any group
- Removing the strong RSA assumption from arguments over the integers
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Simple and efficient batch verification techniques for verifiable delay functions
- Improved DSA variant for batch verification
- ID-based authenticated group key agreement from bilinear maps
- Algebraic (trapdoor) one-way functions: constructions and applications
- Simplified small exponent test for batch verification
- Batch verification for digital signatures
- Finding Invalid Signatures in Pairing-Based Batches
- Improved Harn Batch Digital Signature Algorithm for Multicast Authentication
- Efficient succinct zero-knowledge arguments in the CL framework
- Efficient Unique Ring Signature for Blockchain Privacy Protection
- Accelerating oblivious transfer with batch multi-exponentiation
- Toward compact public key encryption based on CDH assumption via extended twin DH assumption
- Cut down the tree to achieve constant complexity in divisible e-cash
- Strongly secure certificateless signature scheme supporting batch verification
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 Q4249641)
