default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Heath
Person information
Other persons with a similar name
- David F. Garway-Heath
![[0000-0003-2907-6992]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-2907-6992")
(aka: David Garway-Heath) - David C. Heath
- David G. Heath
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Yunang Chen, David Heath, Rahul Chatterjee, Earlence Fernandes:
Scalable Metadata-Hiding for Privacy-Preserving IoT Systems. Proc. Priv. Enhancing Technol. 2024(4): 649-664 (2024)- [c22]David Heath:
Efficient Arithmetic in Garbled Circuits. EUROCRYPT (5) 2024: 3-31 - [c21]David Heath, Vladimir Kolesnikov, Lucien K. L. Ng:
Garbled Circuit Lookup Tables with Logarithmic Number of Ciphertexts. EUROCRYPT (5) 2024: 185-215 - [c20]Yibin Yang, David Heath:
Two Shuffles Make a RAM: Improved Constant Overhead Zero Knowledge RAM. USENIX Security Symposium 2024 - [i29]David Heath:
Efficient Arithmetic in Garbled Circuits. IACR Cryptol. ePrint Arch. 2024: 139 (2024) - [i28]David Heath, Vladimir Kolesnikov, Lucien K. L. Ng:
Garbled Circuit Lookup Tables with Logarithmic Number of Ciphertexts. IACR Cryptol. ePrint Arch. 2024: 369 (2024) - [i27]Yibin Yang, David Heath, Carmit Hazay, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam:
Tight ZK CPU: Batched ZK Branching with Cost Proportional to Evaluated Instruction. IACR Cryptol. ePrint Arch. 2024: 456 (2024) - [i26]Ananya Appan, David Heath, Ling Ren:
Oblivious Single Access Machines: A New Model for Oblivious Computation. IACR Cryptol. ePrint Arch. 2024: 1029 (2024) - [i25]Carmit Hazay, David Heath, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam, Yibin Yang:
LogRobin++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK. IACR Cryptol. ePrint Arch. 2024: 1427 (2024) - 2023
- [j5]Ian Sweet, David Darais, David Heath, William Harris, Ryan Estes, Michael Hicks:
Symphony: Expressive Secure Multiparty Computation with Coordination. Art Sci. Eng. Program. 7(3) (2023) - [c19]Yibin Yang, David Heath, Carmit Hazay, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam:
Batchman and Robin: Batched and Non-batched Branching for Interactive ZK. CCS 2023: 1452-1466 - [c18]Yibin Yang, Stanislav Peceny, David Heath, Vladimir Kolesnikov:
Towards Generic MPC Compilers via Variable Instruction Set Architectures (VISAs). CCS 2023: 2516-2530 - [c17]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Tri-State Circuits - A Circuit Model that Captures RAM. CRYPTO (4) 2023: 128-160 - [i24]Ian Sweet, David Darais, David Heath, William Harris, Ryan Estes, Michael Hicks:
Symphony: Expressive Secure Multiparty Computation with Coordination. CoRR abs/2302.10076 (2023) - [i23]David Heath:
Parallel RAM from Cyclic Circuits. CoRR abs/2309.05133 (2023) - [i22]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Tri-State Circuits: A Circuit Model that Captures RAM. Electron. Colloquium Comput. Complex. TR23 (2023) - [i21]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Tri-State Circuits: A Better Model of Computation for Garbling. IACR Cryptol. ePrint Arch. 2023: 455 (2023) - [i20]Yibin Yang, Stanislav Peceny, David Heath, Vladimir Kolesnikov:
Towards Generic MPC Compilers via Variable Instruction Set Architectures (VISAs). IACR Cryptol. ePrint Arch. 2023: 953 (2023) - [i19]Yibin Yang, David Heath:
Two Shuffles Make a RAM: Improved Constant Overhead Zero Knowledge RAM. IACR Cryptol. ePrint Arch. 2023: 1115 (2023) - [i18]Yibin Yang, David Heath, Carmit Hazay, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam:
Batchman and Robin: Batched and Non-batched Branching for Interactive ZK. IACR Cryptol. ePrint Arch. 2023: 1257 (2023) - [i17]Cruz Barnum, David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Adaptive Garbled Circuits and Garbled RAM from Non-Programmable Random Oracles. IACR Cryptol. ePrint Arch. 2023: 1527 (2023) - 2022
- [b1]David Heath:
New Directions in Garbled Circuits. Georgia Institute of Technology, Atlanta, GA, USA, 2022 - [c16]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
EpiGRAM: Practical Garbled RAM. EUROCRYPT (1) 2022: 3-33 - [c15]Abida Haque, David Heath, Vladimir Kolesnikov, Steve Lu, Rafail Ostrovsky, Akash Shah:
Garbled Circuits with Sublinear Evaluator. EUROCRYPT (1) 2022: 37-64 - [c14]Yibin Yang, David Heath, Vladimir Kolesnikov, David Devecsery:
EZEE: Epoch Parallel Zero Knowledge for ANSI C. EuroS&P 2022: 109-123 - [i16]David Heath, Vladimir Kolesnikov, Jiahui Lu:
Efficient Generic Arithmetic for KKW Practical Linear: MPC-in-the-Head NIZK on Commodity Hardware without Trusted Setup. IACR Cryptol. ePrint Arch. 2022: 795 (2022) - [i15]Abida Haque, David Heath, Vladimir Kolesnikov, Steve Lu, Rafail Ostrovsky, Akash Shah:
Garbled Circuits With Sublinear Evaluator. IACR Cryptol. ePrint Arch. 2022: 797 (2022) - [i14]David Heath, Vladimir Kolesnikov:
One Hot Garbling. IACR Cryptol. ePrint Arch. 2022: 798 (2022) - [i13]David Heath, Vladimir Kolesnikov:
A 2.1 KHz Zero-Knowledge Processor with BubbleRAM. IACR Cryptol. ePrint Arch. 2022: 809 (2022) - [i12]David Heath, Yibin Yang, David Devecsery, Vladimir Kolesnikov:
Zero Knowledge for Everything and Everyone: Fast ZK Processor with Cached RAM for ANSI C Programs. IACR Cryptol. ePrint Arch. 2022: 810 (2022) - [i11]Yibin Yang, David Heath, Vladimir Kolesnikov, David Devecsery:
EZEE: Epoch Parallel Zero Knowledge for ANSI C. IACR Cryptol. ePrint Arch. 2022: 811 (2022) - 2021
- [c13]David Heath, Vladimir Kolesnikov, Stanislav Peceny:
Garbling, Stacked and Staggered - Faster k-out-of-n Garbled Function Evaluation. ASIACRYPT (2) 2021: 245-274 - [c12]David Heath, Vladimir Kolesnikov:
PrORAM - Fast P(logn) Authenticated Shares ZK ORAM. ASIACRYPT (4) 2021: 495-525 - [c11]David Heath, Vladimir Kolesnikov:
One Hot Garbling. CCS 2021: 574-593 - [c10]David Heath, Vladimir Kolesnikov, Jiahui Lu:
Efficient Generic Arithmetic for KKW - Practical Linear MPC-in-the-Head NIZK on Commodity Hardware Without Trusted Setup. CSCML 2021: 414-431 - [c9]David Heath, Vladimir Kolesnikov:
sf LogStack: Stacked Garbling with O(b log b) Computation. EUROCRYPT (3) 2021: 3-32 - [c8]David Heath, Vladimir Kolesnikov, Stanislav Peceny:
Masked Triples - Amortizing Multiplication Triples Across Conditionals. Public Key Cryptography (2) 2021: 319-348 - [c7]David Heath, Yibin Yang, David Devecsery, Vladimir Kolesnikov:
Zero Knowledge for Everything and Everyone: Fast ZK Processor with Cached ORAM for ANSI C Programs. SP 2021: 1538-1556 - [i10]David Heath, Vladimir Kolesnikov:
LogStack: Stacked Garbling with O(b log b) Computation. IACR Cryptol. ePrint Arch. 2021: 531 (2021) - [i9]David Heath, Vladimir Kolesnikov:
PrORAM: Fast O(log n) Private Coin ZK ORAM. IACR Cryptol. ePrint Arch. 2021: 587 (2021) - [i8]David Heath, Vladimir Kolesnikov, Stanislav Peceny:
Masked Triples: Amortizing Multiplication Triples across Conditionals. IACR Cryptol. ePrint Arch. 2021: 604 (2021) - [i7]David Heath, Vladimir Kolesnikov, Rafail Ostrovsky:
Practical Garbled RAM: GRAM with O(log2 n) Overhead. IACR Cryptol. ePrint Arch. 2021: 1519 (2021) - [i6]David Heath, Vladimir Kolesnikov, Stanislav Peceny:
Garbling, Stacked and Staggered: Faster k-out-of-n Garbled Function Evaluation. IACR Cryptol. ePrint Arch. 2021: 1590 (2021) - 2020
- [c6]David Heath, Vladimir Kolesnikov, Stanislav Peceny:
MOTIF: (Almost) Free Branching in GMW - Via Vector-Scalar Multiplication. ASIACRYPT (3) 2020: 3-30 - [c5]David Heath, Vladimir Kolesnikov:
A 2.1 KHz Zero-Knowledge Processor with BubbleRAM. CCS 2020: 2055-2074 - [c4]David Heath, Vladimir Kolesnikov:
Stacked Garbling - Garbled Circuit Proportional to Longest Execution Path. CRYPTO (2) 2020: 763-792 - [c3]David Heath, Vladimir Kolesnikov:
Stacked Garbling for Disjunctive Zero-Knowledge Proofs. EUROCRYPT (3) 2020: 569-598 - [i5]David Heath, Vladimir Kolesnikov:
Stacked Garbling for Disjunctive Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2020: 136 (2020) - [i4]David Heath, Vladimir Kolesnikov:
Stacked Garbling: Garbled Circuit Proportional to Longest Execution Path. IACR Cryptol. ePrint Arch. 2020: 973 (2020) - [i3]David Heath, Vladimir Kolesnikov, Stanislav Peceny:
MOTIF: (Almost) Free Branching in GMW via Vector-Scalar Multiplication. IACR Cryptol. ePrint Arch. 2020: 1175 (2020)
2010 – 2019
- 2019
- [c2]Qi Zhou, David Heath, William Harris:
Relational Verification via Invariant-Guided Synchronization. HCVS/PERR@ETAPS 2019: 28-41 - 2017
- [i2]Qi Zhou, David Heath, William Harris:
Completely Automated Equivalence Proofs. CoRR abs/1705.03110 (2017) - [i1]Caleb Voss, David Heath, William Harris:
Proofs as Relational Invariants of Synthesized Execution Grammars. CoRR abs/1710.03357 (2017)
2000 – 2009
- 2007
- [j4]Philippe Artzner, Freddy Delbaen, Jean-Marc Eber, David Heath, Hyejin Ku:
Coherent multiperiod risk adjusted values and Bellman's principle. Ann. Oper. Res. 152(1): 5-22 (2007) - 2006
- [j3]David Heath, Hyejin Ku:
Consistency among trading desks. Finance Stochastics 10(3): 331-340 (2006)
1990 – 1999
- 1998
- [j2]David Heath, Sidney Resnick, Gennady Samorodnitsky:
Heavy Tails and Long Range Dependence in On/Off Processes and Associated Fluid Models. Math. Oper. Res. 23(1): 145-165 (1998) - 1997
- [c1]David Heath, Derek Allum:
The Historical Development of Computer Chess and its Impact on Artificial Intelligence. Deep Blue Versus Kasparov: The Significance for Artificial Intelligence 1997: 63-
1980 – 1989
- 1988
- [j1]David Heath, Carl Diegert:
On learning through competition. Neural Networks 1(Supplement-1): 100 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 01:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
