The following pages link to Fangguo Zhang (Q411042):
Displaying 50 items.
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Efficient precomputation schemes of \(kP+lQ\) (Q436568) (← links)
- Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714) (← links)
- Computing elliptic curve discrete logarithms with the negation map (Q454851) (← links)
- Efficient computation outsourcing for inverting a class of homomorphic functions (Q508607) (← links)
- New receipt-free voting scheme using double-trapdoor commitment (Q543836) (← links)
- Computing bilinear pairings on elliptic curves with automorphisms (Q629880) (← links)
- Generic security-amplifying methods of ordinary digital signatures (Q712706) (← links)
- Secret handshakes from ID-based message recovery signatures: a new generic approach (Q714315) (← links)
- Identity-based trapdoor mercurial commitments and applications (Q719291) (← links)
- Solutions to the anti-piracy problem in oblivious transfer (Q899580) (← links)
- Identity-based chameleon hashing and signatures without key exposure (Q903661) (← links)
- Efficient Tate pairing computation using double-base chains (Q954437) (← links)
- Efficient generic on-line/off-line (threshold) signatures without key exposure (Q955733) (← links)
- Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05 (Q989506) (← links)
- (Q1400045) (redirect page) (← links)
- Secure Web transaction with anonymous mobile agent over Internet (Q1400047) (← links)
- Selection of secure hyperelliptic curves of \textit{g=2} based on a subfield (Q1433966) (← links)
- Bit security of the hyperelliptic curves Diffie-Hellman problem (Q1616877) (← links)
- Implementing indistinguishability obfuscation using GGH15 (Q1745002) (← links)
- Cryptanalysis of Lee-Hwang-Li's key authentication scheme (Q1763223) (← links)
- New identity-based society oriented signature schemes from pairings on elliptic curves (Q1765412) (← links)
- Speeding up elliptic curve discrete logarithm computations with point halving (Q1943980) (← links)
- Discrete logarithm based chameleon hashing and signatures without key exposure (Q1952523) (← links)
- Functional encryption for cubic polynomials and implementation (Q1981766) (← links)
- Efficient obfuscation for CNF circuits and applications in cloud computing (Q2001194) (← links)
- Optimized arithmetic operations for isogeny-based cryptography on Huff curves (Q2030861) (← links)
- An efficient blind signature scheme based on SM2 signature algorithm (Q2057164) (← links)
- Identity based linkable ring signature with logarithmic size (Q2151286) (← links)
- Optimizing the evaluation of \(\ell\)-isogenous curve for isogeny-based cryptography (Q2169440) (← links)
- Privacy preserving multi-party computation delegation for deep learning in cloud computing (Q2198099) (← links)
- Solving ECDLP via list decoding (Q2283611) (← links)
- Deniable searchable symmetric encryption (Q2293186) (← links)
- Secure linear system computation in the presence of malicious adversaries (Q2335946) (← links)
- Attack on an ID-based authenticated group key agreement scheme from PKC 2004 (Q2390308) (← links)
- Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm (Q2408279) (← links)
- Attack on Han et al.'s ID-based confirmer (undeniable) signature at ACM-EC'03 (Q2573579) (← links)
- Anonymous post-quantum cryptocash (Q2656947) (← links)
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem (Q2663594) (← links)
- Lattice-based secret handshakes with reusable credentials (Q2672459) (← links)
- Quantum algorithm for solving hyperelliptic curve discrete logarithm problem (Q2677607) (← links)
- Inner-product functional encryption from random linear codes: trial and challenges (Q2697925) (← links)
- Secret handshakes: full dynamicity, deniability and lattice-based design (Q2699945) (← links)
- A New Signature Scheme Without Random Oracles from Bilinear Pairings (Q2876965) (← links)
- Traitor Tracing against Public Collaboration (Q3001888) (← links)
- On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem (Q3005597) (← links)
- Finding More Boolean Functions with Maximum Algebraic Immunity Based on Univariate Polynomial Representation (Q3012975) (← links)
- Comments and Improvements on Key-Exposure Free Chameleon Hashing Based on Factoring (Q3019944) (← links)
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures (Q3092357) (← links)
- Oblivious Transfer with Complex Attribute-Based Access Control (Q3095003) (← links)
