scientific article; zbMATH DE number 1303125
From MaRDI portal
Publication:4249640
zbMath0929.68052MaRDI QIDQ4249640
Marcus Peinado, Victor Boyko, Ramarathnam Venkatesan
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16)
Related Items (12)
Improved Cryptographic Puzzle Based on Modular Exponentiation ⋮ CRT-Based Outsourcing Algorithms for Modular Exponentiations ⋮ Reusing nonces in Schnorr signatures (and keeping it secure...) ⋮ Efficient and secure delegation of exponentiation in general groups to a single malicious server ⋮ On the uniformity of distribution of the RSA pairs ⋮ Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions ⋮ Efficient algorithms for secure outsourcing of bilinear pairings ⋮ Speeding up exponentiation using an untrusted computational resource ⋮ Delegating a product of group exponentiations with application to signature schemes ⋮ Towards a Provably Secure DoS-Resilient Key Exchange Protocol with Perfect Forward Secrecy ⋮ A polynomial-time algorithm for solving the hidden subset sum problem ⋮ On the distribution of the Diffie-Hellman pairs
This page was built for publication:
