scientific article; zbMATH DE number 1303125
From MaRDI portal
Publication:4249640
zbMATH Open0929.68052MaRDI QIDQ4249640FDOQ4249640
Authors: Victor Boyko, Marcus Peinado, Ramarathnam Venkatesan
Publication date: 17 June 1999
Title of this publication is not available (Why is that?)
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Cited In (14)
- Title not available (Why is that?)
- Speeding up exponentiation using an untrusted computational resource
- Title not available (Why is that?)
- Delegating a product of group exponentiations with application to signature schemes
- On the distribution of the Diffie-Hellman pairs
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- On the uniformity of distribution of the RSA pairs
- CRT-based outsourcing algorithms for modular exponentiations
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
- Efficient algorithms for secure outsourcing of bilinear pairings
- Reusing nonces in Schnorr signatures (and keeping it secure...)
- Improved cryptographic puzzle based on~modular exponentiation
- Towards a provably secure DoS-resilient key exchange protocol with perfect forward secrecy
- A polynomial-time algorithm for solving the hidden subset sum problem
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 Q4249640)