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.
In: LNCS, In: Public-Key Cryptography - PKC 2016, p. 24,
Springer, Taipei, Taiwan, ISBN 978-3-662-49384-7,
DOI: 10.1007/978-3-662-49384-7_3,
[Conference or Workshop Item]

Item Type: Conference or Workshop Item
Erschienen: 2016
Creators: Bernhard, David ; Fischlin, Marc ; Warinschi, Bogdan
Title: On the Hardness of Proving CCA-Security of Signed ElGamal
Language: German
Book Title: Public-Key Cryptography - PKC 2016
Series: LNCS
Issue Number: 9614
Publisher: Springer
ISBN: 978-3-662-49384-7
Uncontrolled Keywords: Primitives;P2
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)
Event Location: Taipei, Taiwan
Date Deposited: 15 Nov 2016 23:15
DOI: 10.1007/978-3-662-49384-7_3
Identification Number: TUD-CS-2016-14660
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
OAI 2.0-Basis-URL: https://tubiblio.ulb.tu-darmstadt.de/cgi/oai2 TUbiblio verwendet EPrints 3.
Drucken | Impressum | Datenschutzerklärung