Oracle Machines
Oracle Machines is a theoretical computational model that extends a Turing machine by incorporating an oracle—a black box capable of solving specific decision problems in a single computational step, thereby enabling the exploration of relative computability and hierarchies of unsolvability.
52
Publications
2.3K
Citations
114
Authors
62
Institutions
Publications per year
2017–2026
10
52
Lower bounds on the efficiency of generic cryptographic constructions
Rosario Gennaro, Luca Trevisan · 2002 · 137 citations
1–5 of 52
114
4
h-index
4
h-index
4
h-index
3
h-index
2
h-index
1–5 of 114
62

Swansea University
Swansea, United Kingdom
4 h-index
8 publications
214 citations
Instituto Politécnico de Lisboa
Lisbon, Portugal
4 h-index
7 publications
194 citations
University of Lisbon
Lisbon, Portugal
3 h-index
6 publications
174 citations
Fundação para a Ciência e Tecnologia
Lisbon, Portugal
3 h-index
5 publications
136 citations
University of California, Santa Barbara
Santa Barbara, United States
3 h-index
3 publications
202 citations

Newcastle University
Newcastle upon Tyne, United Kingdom
2 h-index
2 publications
45 citations
Brest State Technical University
Brest, Belarus
2 h-index
12 publications
282 citations
Stony Brook University
Stony Brook, United States
2 h-index
2 publications
76 citations
1–8 of 62
6 publications · 684 citations
6
h-index
IJFCS · 2 publications · 25 citations
2
h-index
2 publications · 44 citations
2
h-index
2 publications · 73 citations
2
h-index
2 publications · 99 citations
2
h-index
1–5