Efficient undeniable signature schemes based on ideal arithmetic in quadratic orders
From MaRDI portal
Publication:1431610
DOI10.1023/B:DESI.0000012439.20075.16zbMath1060.94031MaRDI QIDQ1431610
Tsuyoshi Takagi, Ingrid Biehl, Sacher Paulus
Publication date: 11 June 2004
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
11R11: Quadratic extensions
94A60: Cryptography
94A62: Authentication, digital signatures and secret sharing
Related Items
A Generic Construction for Universally-Convertible Undeniable Signatures, Certificateless undeniable signature scheme, Universally Composable Undeniable Signature, On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
Uses Software