TU Darmstadt / ULB / TUbiblio

On the Hardness of Proving CCA-Security of Signed ElGamal

Bernhard, David ; Fischlin, Marc ; Warinschi, Bogdan (2016)
On the Hardness of Proving CCA-Security of Signed ElGamal.
Taipei, Taiwan
doi: 10.1007/978-3-662-49384-7_3
Conference or Workshop Item, Bibliographie

Item Type: Conference or Workshop Item
Erschienen: 2016
Creators: Bernhard, David ; Fischlin, Marc ; Warinschi, Bogdan
Type of entry: Bibliographie
Title: On the Hardness of Proving CCA-Security of Signed ElGamal
Language: German
Date: March 2016
Publisher: Springer
Issue Number: 9614
Book Title: Public-Key Cryptography - PKC 2016
Series: LNCS
Event Location: Taipei, Taiwan
DOI: 10.1007/978-3-662-49384-7_3
Uncontrolled Keywords: Primitives;P2
Identification Number: TUD-CS-2016-14660
Divisions: DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres > CRC 1119: CROSSING – Cryptography-Based Security Solutions: Enabling Trust in New and Next Generation Computing Environments
Profile Areas > Cybersecurity (CYSEC)
20 Department of Computer Science > Cryptography and Complexity Theory
DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres
20 Department of Computer Science
Profile Areas
DFG-Collaborative Research Centres (incl. Transregio)
Date Deposited: 15 Nov 2016 23:15
Last Modified: 17 May 2018 13:02
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