The following pages link to (Q4249641):
Displaying 35 items.
- ID-based authenticated group key agreement from bilinear maps (Q352009) (← links)
- Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
- Simplified small exponent test for batch verification (Q501674) (← links)
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures (Q826296) (← links)
- Improved batch exponentiation (Q989500) (← links)
- Strongly secure certificateless signature scheme supporting batch verification (Q1719253) (← links)
- Batch verification of short signatures (Q1928768) (← links)
- Delegating a product of group exponentiations with application to signature schemes (Q2025335) (← links)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- Partially structure-preserving signatures: lower bounds, constructions and more (Q2117038) (← links)
- Comments on efficient batch verification test for digital signatures based on elliptic curves (Q2144626) (← links)
- Improved signature schemes for secure multi-party computation with certified inputs (Q2167761) (← links)
- Efficient and secure delegation of exponentiation in general groups to a single malicious server (Q2209264) (← links)
- Speeding-up verification of digital signatures (Q2220442) (← links)
- Security reconsideration of the Huang-Wang nominative signature (Q2476775) (← links)
- Improved DSA variant for batch verification (Q2572327) (← links)
- A new batch verifying scheme for identifying illegal signatures (Q2637304) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- Secure Application Execution in Mobile Devices (Q2803652) (← links)
- Accelerating Oblivious Transfer with Batch Multi-exponentiation (Q2817471) (← links)
- Really Fast Syndrome-Based Hashing (Q3011909) (← links)
- Batch Computations Revisited: Combining Key Computations and Batch Verifications (Q3084250) (← links)
- Toward Compact Public Key Encryption Based on CDH Assumption via Extended Twin DH Assumption (Q3092354) (← links)
- A Secure and Efficient Proof of Integer in an Interval Range (Q3104687) (← links)
- Practical Short Signature Batch Verification (Q3623054) (← links)
- Improved Harn Batch Digital Signature Algorithm for Multicast Authentication (Q5069653) (← links)
- Faster Batch Verification of Standard ECDSA Signatures Using Summation Polynomials (Q5168560) (← links)
- Finding Invalid Signatures in Pairing-Based Batches (Q5447507) (← links)
- Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash (Q5738783) (← links)
- Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) (← links)
- Practical statistically-sound proofs of exponentiation in any group (Q6104340) (← links)
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup (Q6132411) (← links)
- Efficient Unique Ring Signature for Blockchain Privacy Protection (Q6488394) (← links)
- Bicorn: an optimistically efficient distributed randomness beacon (Q6573968) (← links)
- Efficient succinct zero-knowledge arguments in the CL framework (Q6665550) (← links)
