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
Parents
19
Exponential Lower Bounds for Monotone Span Programs
Robert Robere, Toniann Pitassi, Benjamin Rossman et al. · 2016 · 69 citations
1–5 of 19
61
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 61
39
Feng Chia University
Taichung, Taiwan
2 h-index
2 publications
31 citations
Ben-Gurion University of the Negev
Beersheba, Israel
2 h-index
3 publications
40 citations
Technion – Israel Institute of Technology
Haifa, Israel
1 h-index
2 publications
36 citations

Télécom Paris
Palaiseau, France
1 h-index
1 publications
23 citations
University of Chinese Academy of Sciences
Beijing, China
1 h-index
4 publications
100 citations

University of Toronto
Toronto, Canada
1 h-index
4 publications
276 citations
Edo State University Uzairue
Auchi, Nigeria
1 h-index
1 publications
37 citations
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
3 publications
87 citations
1–8 of 39
Repository · 2 publications · 53 citations
2
h-index
2 publications · 84 citations
2
h-index
1 publications · 11 citations
1
h-index
JCM · 1 publications · 16 citations
1
h-index
1 publications · 23 citations
1
h-index
1–5