On the fly authentication and signature schemes based on groups of unknown order

DOI10.1007/s00145-006-0224-0zbMath1133.94345OpenAlexW2047137914WikidataQ56589265 ScholiaQ56589265MaRDI QIDQ862419

Jacques Stern, Marc Girault, Guillaume Poupard

Publication date: 24 January 2007

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-006-0224-0

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (14)

New lattice attacks on DSA schemes ⋮ Tightly secure signatures from lossy identification schemes ⋮ Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups ⋮ Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use ⋮ Lossy Identification Schemes from Decisional RSA ⋮ On Privacy Models for RFID ⋮ Signcryption Schemes Based on the Diffie–Hellman Problem ⋮ Task-structured probabilistic I/O automata ⋮ Good Variants of HB +  Are Hard to Find ⋮ Lattice-Based Identification Schemes Secure Under Active Attacks ⋮ : Increasing the Security and Efficiency of ⋮ Legally Fair Contract Signing Without Keystones ⋮ An Efficient On-Line/Off-Line Signature Scheme without Random Oracles ⋮ The GPS Identification Scheme Using Frobenius Expansions

This page was built for publication: On the fly authentication and signature schemes based on groups of unknown order