default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTim Wood 0003
Person information
- affiliation: University of Bristol, UK
- affiliation: KU Leuven, IMEC-COSIC, Belgium
Other persons with the same name
- Tim Wood 0001 (aka: Timothy J. Wood) — AMD Inc., Austin, TX, USA
- Timothy Wood 0002
![[0000-0003-0262-8128]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-0262-8128")
(aka: Tim Wood 0002) — University of California San Diego, Swartz Center for Computational Neuroscience, CA, USA (and 1 more) - Tim Wood 0004 — Imperial College London, UK
- Tim Wood 0005 — Institute for Environmental Science and Research, New Zealand
- Timothy Wood 0001 (aka: Tim Wood 0006) — George Washington University, Washington, D.C., USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Tim Wood, Keerthi Thomas, Matthew Dean, Swaminathan Kannan, Robert Learney:
Towards Post-Quantum Verifiable Credentials. ARES 2024: 88:1-88:10- 2022
- [j1]Dragos Rotaru, Nigel P. Smart, Titouan Tanguy, Frederik Vercauteren, Tim Wood:
Actively Secure Setup for SPDZ. J. Cryptol. 35(1): 5 (2022) - 2021
- [c6]Eleftheria Makri, Tim Wood:
Full-Threshold Actively-Secure Multiparty Arithmetic Circuit Garbling. LATINCRYPT 2021: 407-430
2010 – 2019
- 2019
- [b1]Tim N. Wood:
Reducing communication costs in multi-party computation. University of Bristol, UK, 2019 - [c5]Abdelrahaman Aly, Emmanuela Orsini, Dragos Rotaru, Nigel P. Smart, Tim Wood:
Zaphod: Efficiently Combining LSSS and Garbled Circuits in SCALE. WAHC@CCS 2019: 33-44 - [c4]Nigel P. Smart, Tim Wood:
Error Detection in Monotone Span Programs with Application to Communication-Efficient Multi-party Computation. CT-RSA 2019: 210-229 - [c3]Dragos Rotaru, Tim Wood:
MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security. INDOCRYPT 2019: 227-249 - [i7]Dragos Rotaru, Tim Wood:
MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security. IACR Cryptol. ePrint Arch. 2019: 207 (2019) - [i6]Abdelrahaman Aly, Emmanuela Orsini, Dragos Rotaru, Nigel P. Smart, Tim Wood:
Zaphod: Efficiently Combining LSSS and Garbled Circuits in SCALE. IACR Cryptol. ePrint Arch. 2019: 974 (2019) - [i5]Eleftheria Makri, Tim Wood:
Full-Threshold Actively-Secure Multiparty Arithmetic Circuit Garbling. IACR Cryptol. ePrint Arch. 2019: 1098 (2019) - [i4]Dragos Rotaru, Nigel P. Smart, Titouan Tanguy, Frederik Vercauteren, Tim Wood:
Actively Secure Setup for SPDZ. IACR Cryptol. ePrint Arch. 2019: 1300 (2019) - 2018
- [c2]Marcel Keller, Dragos Rotaru, Nigel P. Smart, Tim Wood:
Reducing Communication Channels in MPC. SCN 2018: 181-199 - [i3]Nigel P. Smart, Tim Wood:
Error-Detecting in Monotone Span Programs with Application to Communication Efficient Multi-Party Computation. IACR Cryptol. ePrint Arch. 2018: 467 (2018) - 2017
- [c1]Peter Scholl, Nigel P. Smart, Tim Wood:
When It's All Just Too Much: Outsourcing MPC-Preprocessing. IMACC 2017: 77-99 - [i2]Peter Scholl, Nigel P. Smart, Tim Wood:
When It's All Just Too Much: Outsourcing MPC-Preprocessing. IACR Cryptol. ePrint Arch. 2017: 262 (2017) - [i1]Marcel Keller, Dragos Rotaru, Nigel P. Smart, Tim Wood:
Reducing Communication Channels in MPC. IACR Cryptol. ePrint Arch. 2017: 492 (2017)
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 2025-01-20 22:54 CET 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:
