default search action
Dominik Raub
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [c8]Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub:
Passive Corruption in Statistical Multi-Party Computation - (Extended Abstract). ICITS 2012: 129-146 - [i7]Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub:
Passive Corruption in Statistical Multi-Party Computation. IACR Cryptol. ePrint Arch. 2012: 272 (2012) - 2011
- [c7]Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub:
Graceful Degradation in Multi-Party Computation (Extended Abstract). ICITS 2011: 163-180 - [i6]Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub:
Graceful Degradation in Multi-Party Computation. IACR Cryptol. ePrint Arch. 2011: 94 (2011) - 2010
- [c6]Christoph Lucas, Dominik Raub, Ueli M. Maurer:
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy. PODC 2010: 219-228
2000 – 2009
- 2009
- [b1]Dominik Raub:
Exploring the Limits of Multi-Party Computation. ETH Zurich, Zürich, Switzerland, 2009 - [c5]Robin Künzler, Jörn Müller-Quade, Dominik Raub:
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security. TCC 2009: 238-255 - [i5]Christoph Lucas, Dominik Raub, Ueli Maurer:
Hybrid-Secure MPC: Trading Information-Theoretic Robustness for Computational Privacy. IACR Cryptol. ePrint Arch. 2009: 9 (2009) - [i4]Matthias Fitzi, Dominik Raub:
Tight Bounds for Protocols with Hybrid Security. IACR Cryptol. ePrint Arch. 2009: 434 (2009) - 2008
- [i3]Robin Künzler, Jörn Müller-Quade, Dominik Raub:
Secure Computability of Functions in the IT setting with Dishonest Majority and Applications to Long-Term Security. IACR Cryptol. ePrint Arch. 2008: 264 (2008) - 2007
- [c4]Ueli M. Maurer, Dominik Raub:
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations. ASIACRYPT 2007: 427-443 - [i2]Ueli Maurer, Dominik Raub:
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations. IACR Cryptol. ePrint Arch. 2007: 89 (2007) - 2006
- [c3]Dominik Raub, Rainer Steinwandt:
An Algebra for Enterprise Privacy Policies Closed Under Composition and Conjunction. ETRICS 2006: 130-144 - 2005
- [c2]Dominik Raub, Rainer Steinwandt, Jörn Müller-Quade:
On the Security and Composability of the One Time Pad. SOFSEM 2005: 288-297 - 2004
- [c1]Dominik Raub, John W. McDonough, Matthias Wölfel:
A cepstral domain maximum likelihod beamformer for speech recognition. INTERSPEECH 2004: 817-820 - [i1]Dominik Raub, Rainer Steinwandt, Jörn Müller-Quade:
On the Security and Composability of the One Time Pad. IACR Cryptol. ePrint Arch. 2004: 113 (2004)
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-04-24 23:12 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: