Efficient undeniable signature schemes based on ideal arithmetic in quadratic orders
From MaRDI portal
Publication:1431610
DOI10.1023/B:DESI.0000012439.20075.16zbMath1060.94031OpenAlexW2064433037MaRDI QIDQ1431610
Ingrid Biehl, Tsuyoshi Takagi, Sacher Paulus
Publication date: 11 June 2004
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:desi.0000012439.20075.16
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Quadratic extensions (11R11) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items
Universally Composable Undeniable Signature ⋮ Short undeniable signatures based on group homomorphisms ⋮ Certificateless undeniable signature scheme ⋮ Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом ⋮ A Generic Construction for Universally-Convertible Undeniable Signatures ⋮ On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
Uses Software