TU Darmstadt / ULB / TUbiblio

Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders

Biehl, Ingrid ; Paulus, Sachar ; Takagi, Tsuyoshi (2004)
Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders.
In: >IJDCC: Designs, Codes and Cryptography, 31 (2)
Article, Bibliographie

Item Type: Article
Erschienen: 2004
Creators: Biehl, Ingrid ; Paulus, Sachar ; Takagi, Tsuyoshi
Type of entry: Bibliographie
Title: Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders
Language: German
Date: 2004
Journal or Publication Title: >IJDCC: Designs, Codes and Cryptography
Volume of the journal: 31
Issue Number: 2
Identification Number: Biehl:Paulus:Takagi:2004
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra
Date Deposited: 04 Aug 2016 15:08
Last Modified: 13 Oct 2020 04:37
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details