Encryption Scheme Security Proofs

Encryption Scheme Security Proofs is a formal method in cryptography that establishes the theoretical resilience of an encryption scheme against well-defined adversarial attacks by reducing its security to the hardness of underlying computational problems.

106

Publications

5.4K

Citations

323

Authors

161

Institutions

Publications per year

2017–2026

30

Authors

323

  1. WS
    Willy Susilo

    University of Wollongong, Australia

    3 publications · 127 citations

    3

    h-index

  2. NZ
    Nanrun Zhou

    Nanchang University, China

    2 publications · 178 citations

    2

    h-index

  3. DK
    Daesung Kwon

    Electronics and Telecommunications Research Institute, South Korea

    2 publications · 55 citations

    2

    h-index

  4. DS
    Duncan S. Wong

    City University of Hong Kong, Hong Kong SAR China

    2 publications · 72 citations

    2

    h-index

  5. MA
    Michel Abdalla⋆

    École Normale Supérieure - PSL, France

    2 publications · 137 citations

    2

    h-index

1–5 of 323

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 15 publications · 371 citations

    13

    h-index

  2. Designs Codes and Cryptography

    4 publications · 98 citations

    4

    h-index

  3. 3

    h-index

  4. Signal Processing

    3 publications · 538 citations

    3

    h-index

  5. IEEE Transactions on Information Theory

    2 publications · 35 citations

    2

    h-index

1–5