scientific article; zbMATH DE number 2009973
From MaRDI portal
Publication:4434892
zbMATH Open1038.94547MaRDI QIDQ4434892FDOQ4434892
Authors: Jacques Stern 
Publication date: 26 November 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2656/26560449.htm
Title of this publication is not available (Why is that?)
Recommendations
- Another look at ``provable security
- Another Look at “Provable Security”. II
- Why Proving HIBE Systems Secure Is Difficult
- Another look at provable security. (Abstract)
- scientific article; zbMATH DE number 1304296
- scientific article; zbMATH DE number 1304183
- scientific article; zbMATH DE number 2242698
- Cryptanalysis vs. provable security
- Towards Provable Security for Ubiquitous Applications
- Provable security for public key schemes
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cited In (13)
- Another look at ``provable security
- Title not available (Why is that?)
- Cryptanalysis of simple three-party key exchange protocol (S-3PAKE)
- Cryptanalysis vs. provable security
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Cryptanalysis of a chaotic map-based password-authenticated key agreement protocol using smart cards
- Title not available (Why is that?)
- Machine-checked security proofs of cryptographic signature schemes
- Critical perspectives on provable security: fifteen years of ``another look papers
- Another look at provable security. (Abstract)
- Title not available (Why is that?)
- Why Proving HIBE Systems Secure Is Difficult
- Provable security for public key schemes
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434892)
