Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Tamer Mour
Observed name:
Mour, Tamer
Institution:
The Italian Institute of Artificial Intelligence
Observed institutions:
Technion – Israel Institute of Technology,
The Italian Institute of Artificial Intelligence,
Weizmann Institute of Science,
Bocconi University
ORCID:
0009-0003-5164-0315
Observed ORCID:
0009-0003-5164-0315
OpenAlex ID:
A5091833609
Trapdoor Hash Functions and Their Applications
2019
·
Nico Döttling
, Sanjam Garg
, et al.
·
Lecture notes in computer science
·
114
NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations
2020
·
Zvika Brakerski
, Venkata Koppula
, et al.
·
Lecture notes in computer science
·
56
Sub-logarithmic Distributed Oblivious RAM with Small Block Size
2019
·
Eyal Kushilevitz
, Tamer Mour
·
Lecture notes in computer science
·
26
PDF
Encrypted Matrix-Vector Products from Secret Dual Codes
2025
·
Fabrice Benhamouda
, Caicai Chen
, et al.
·
ACM SIGSAC Conference on Computer and Communications Security (CCS)
·
14
A New World in the Depths of Microcrypt: Separating OWSGs and Quantum Money from QEFID
2025
·
Amit Behera
, Giulio Malavolta
, et al.
·
Lecture notes in computer science
·
13
PDF
Secret-Key PIR from Random Linear Codes
2026
·
Caicai Chen
, Yuval Ishai
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
3
How to Verify that a Small Device is Quantum, Unconditionally
2025
·
Giulio Malavolta
, Tamer Mour
·
Lecture notes in computer science
·
1
PDF
Locally Testable Tree Codes
2025
·
Tamer Mour
, Alon Rosen
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
1
Correlation Intractability vs. One-wayness.
2021
·
Tamer Mour
·
IACR Cryptology ePrint Archive
·
1
Distributed Oblivious RAM
2025
·
Tamer Mour
·
Springer eBooks
Distributed Oblivious RAM
2023
·
Tamer Mour
·
Springer eBooks
Show more works
View as search
Works count:
13
Citation count:
229
H-index:
5
I10-index:
5
Year
Topic
Type
