Provable security is an essential tool for analyzing security of modern cryptographic primitives. The research community has witnessed the great contributions that the provable security methodology made to the analysis of cryptographic schemes and protocols. Nowadays cryptographic primitives without a rigorous "proof" cannot be regarded as sound. Also, the methodology has been used to discover security flaws in the cryptographic schemes and protocols, which were considered seemingly secure without formal analysis. On the one hand, provable security provides confidence in using cryptographic schemes and protocols for various real-world applications, but on the other hand, schemes with provable security are sometimes not efficient enough to be used in practice, and correctness of the proofs may be difficult to verify. Therefore, ProvSec conference is to provide a platform for researchers, scholars and practitioners to exchange new ideas on diverse problems in provable security.

Conference Topics:

All aspects of provable security in constructing and analyzing cryptographic primitives, including but are not limited to:

    - Provably secure asymmetric primitives
    - Provably secure symmetric primitives
    - Tightness of security reductions
    - Provable security in post-quantum cryptography
    - Privacy and anonymity technologies
    - Cryptographic protocol verifier
    - Theory and practice of game-hopping proof techniques
    - Secure hash functions
    - Provable security in the real-world security systems
    - Secure key management
    - Refinement of proof techniques
    - Provably Secure cryptographic protocols and applications
    - Security notions, approaches and paradigms
    - Steganography
    - Lightweight cryptography
    - Lattice-based cryptography

Publication and Awards:

The conference proceedings will be published by Springer-Verlag in the Lecture Notes in Computer Science series (see www.springer.com/lncs). The best paper(s) and best student paper(s) will be selected and awarded a prize.