scientific article

zbMath0981.94018MaRDI QIDQ2778853

Michael Steiner, Ahmad-Reza Sadeghi

Publication date: 21 March 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2045/20450244

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

generic algorithmscomplexity theoryDiffie-Hellmandiscrete logarithmscryptographic assumptionsinverse exponentsquare exponent

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (10)

Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ Scalable group key exchange protocol with provable security ⋮ On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem ⋮ Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems ⋮ Exponential function analogue of Kloosterman sums ⋮ Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems ⋮ Everybody's a target: scalability in public-key encryption ⋮ Public Verifiability from Pairings in Secret Sharing Schemes ⋮ A secure and scalable group key exchange system

This page was built for publication: