Public Key Cryptography - PKC 2006

DOI10.1007/11745853zbMath1151.94531OpenAlexW4205680410MaRDI QIDQ5898953

Katja Schmidt-Samoa, Kaoru Kurosawa

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11745853

zbMATH Keywords

strong RSA assumptiondivision intractabilityOnline/offline signaturestrapdoor hash

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (9)

A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ A new lattice-based online/offline signatures framework for low-power devices ⋮ How (not) to design strong-RSA signatures ⋮ Efficient generic on-line/off-line (threshold) signatures without key exposure ⋮ An efficient online/offline ID-based short signature procedure using extended chaotic maps ⋮ Identity-Based Online/Offline Encryption ⋮ Faster and Shorter Password-Authenticated Key Exchange ⋮ Divisible On-Line/Off-Line Signatures ⋮ An Efficient On-Line/Off-Line Signature Scheme without Random Oracles

This page was built for publication: Public Key Cryptography - PKC 2006