Pages that link to "Item:Q3689092"

The following pages link to A public key cryptosystem and a signature scheme based on discrete logarithms (Q3689092):

Displaying 50 items.

• Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
• Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption (Q2402372) (← links)
• Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption (Q2403232) (← links)
• Theoretically extensible quantum digital signature with starlike cluster states (Q2411553) (← links)
• Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
• Cryptography on elliptic curves over \(p\) -adic number fields (Q2425853) (← links)
• Gröbner basis cryptosystems (Q2432557) (← links)
• On some connections between statistics and cryptology (Q2437860) (← links)
• Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme (Q2438535) (← links)
• A new digital signature scheme based on chaotic maps (Q2441995) (← links)
• Limits of a conjecture on a leakage-resilient cryptosystem (Q2445905) (← links)
• A provably secure short signature scheme based on discrete logarithms (Q2456500) (← links)
• A new characterization of dual bases in finite fields and its applications (Q2457004) (← links)
• Secure distributed constraint satisfaction: reaching agreement without revealing private information (Q2457708) (← links)
• Developing the concept of one-way functions for cryptographic security systems using achievements in chaotic dynamics (Q2458101) (← links)
• Convertible multi-authenticated encryption scheme (Q2465980) (← links)
• A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\) (Q2475900) (← links)
• An efficient and complete remote user authentication scheme using smart cards (Q2476705) (← links)
• Simple authenticated key agreement and protected password change protocol (Q2485500) (← links)
• Cryptanalysis of an authenticated encryption scheme using self-certified public keys (Q2485613) (← links)
• Elliptic curve cryptosystems in the presence of permanent and transient faults (Q2486874) (← links)
• Cryptanalysis and improvement on batch verifying multiple RSA digital signatures (Q2489411) (← links)
• A dynamic threshold commercial key escrow scheme based on conic (Q2490992) (← links)
• Trading inversions for multiplications in elliptic curve cryptography (Q2491297) (← links)
• Security of the design of time-stamped signatures (Q2495406) (← links)
• A password authentication scheme over insecure networks (Q2495408) (← links)
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887) (← links)
• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation (Q2570694) (← links)
• A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing (Q2570757) (← links)
• Remarks on some signature schemes based on factoring and discrete logarithms (Q2571958) (← links)
• Fail-stop blind signature scheme design based on pairings (Q2571979) (← links)
• A secure and efficient authentication protocol for anonymous channel in wireless communications (Q2571989) (← links)
• Cryptanalysis of some signature schemes with message recovery (Q2572002) (← links)
• One private-key for all DL-based cryptosystems (Q2572050) (← links)
• Security analysis and improvement of a double-trapdoor encryption scheme (Q2572322) (← links)
• Efficient nonrepudiable threshold proxy signature scheme with known signers against the collusion attack (Q2572681) (← links)
• Efficient algorithms for speeding up the computations of elliptic curve cryptosystems (Q2572747) (← links)
• A public-key traitor tracing scheme with revocation using dynamic shares (Q2572960) (← links)
• A public key cryptosystem based on a subgroup membership problem (Q2572970) (← links)
• A novel cryptosystem based on grey system theory and genetic algorithm (Q2573591) (← links)
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation. (Q2583543) (← links)
• An algorithm for modular exponentiation. (Q2583553) (← links)
• Privacy-preserving similarity coefficients for binary data (Q2629408) (← links)
• Attribute-based versions of Schnorr and ElGamal (Q2634583) (← links)
• Multi-use and unidirectional identity-based proxy re-encryption schemes (Q2638201) (← links)
• Secure server-aided data sharing clique with attestation (Q2663469) (← links)
• Secure parameterized pattern matching (Q2663480) (← links)
• Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives (Q2663507) (← links)
• An efficient approach for secure multi-party computation without authenticated channel (Q2663510) (← links)
• Privacy-preserving mixed set operations (Q2663573) (← links)