Oblivious Linear Evaluation is a cryptographic protocol in secure multi-party computation that enables one party to evaluate a linear function on private inputs provided by another party without learning any information about the inputs, while ensuring the evaluating party’s function remains hidden.
9
Publications
274
Citations
34
Authors
24
Institutions
Publications per year
2017–2026
7
Publications
9
Phillipp Schoppmann, Adrià Gascón, Leonie Reichert et al. · 2019 · 83 citations
Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen et al. · 2017 · 49 citations
Carmit Hazay, Yuval Ishai, Antonio Marcedone et al. · 2019 · 32 citations
1–5 of 9
Authors
34
- YI
3
h-index
- SD
2
h-index
- RO
2
h-index
- CH
1
h-index
- AG
1
h-index
1–5 of 34
Institutions
24
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
3 publications
83 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
2 publications
51 citations
University of Luxembourg
Luxembourg, Luxembourg
1 h-index
1 publications
19 citations
De Montfort University
Leicester, United Kingdom
1 h-index
2 publications
20 citations
Google (United States)
Mountain View, United States
1 h-index
1 publications
83 citations
Shandong University of Science and Technology
Qingdao, China
1 h-index
1 publications
19 citations
nChain (United Kingdom)
London, United Kingdom
1 h-index
1 publications
10 citations
Koç University
Istanbul, Türkiye
1 h-index
1 publications
10 citations
1–8 of 24
Venues
- IEEE Transactions on Dependable and Secure Computing
TDSC · 1 publications · 10 citations
1
h-index
- Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
Conference · 1 publications · 30 citations
1
h-index
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
Repository · 1 publications · 21 citations
1
h-index
- Algorithmica
1 publications · 11 citations
1
h-index
- Journal of Ambient Intelligence and Humanized Computing
1 publications · 19 citations
1
h-index
1–5