Computational Secret Sharing

Computational Secret Sharing is a cryptographic scheme within secret sharing that guarantees security against computationally bounded adversaries by relying on computational hardness assumptions rather than information-theoretic secrecy.

19

Publications

533

Citations

61

Authors

39

Institutions

Publications per year

2017–2026

11

Authors

61

  1. AB
    Amos Beimel

    Ben-Gurion University of the Negev, Israel

    2 publications · 29 citations

    2

    h-index

  2. AS
    Aydin Sezgin

    Ruhr University Bochum, Germany

    2 publications · 53 citations

    2

    h-index

  3. JK
    Jaber Kakar

    Ruhr University Bochum, Germany

    2 publications · 53 citations

    2

    h-index

  4. SE
    Seyedhamed Ebadifar

    Ruhr University Bochum, Germany

    2 publications · 53 citations

    2

    h-index

  5. CC
    Chin‐Chen Chang

    Feng Chia University, Taiwan

    1 publications · 11 citations

    1

    h-index

1–5 of 61

Venues

  1. arXiv (Cornell University)

    Repository · 2 publications · 53 citations

    2

    h-index

  2. Multimedia Tools and Applications

    2 publications · 84 citations

    2

    h-index

  3. BMC Medical Genomics

    1 publications · 11 citations

    1

    h-index

  4. Journal of Communications

    JCM · 1 publications · 16 citations

    1

    h-index

  5. IEEE Transactions on Information Theory

    1 publications · 23 citations

    1

    h-index

1–5