default search action
Peter Sebastian Nordholt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j2]Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen
, Peter Sebastian Nordholt, Claudio Orlandi
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer. J. Cryptol. 34(3): 34 (2021) - [c7]Matteo Romiti
Cross-Layer Deanonymization Methods in the Lightning Protocol. Financial Cryptography (1) 2021: 187-204
2010 – 2019
- 2018
- [c6]Peter Sebastian Nordholt, Meilof Veeningen:
Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification. ACNS 2018: 321-339 - [i8]Peter Sebastian Nordholt, Meilof Veeningen:
Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification. IACR Cryptol. ePrint Arch. 2018: 474 (2018) - 2016
- [j1]Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen
Signature Schemes Secure Against Hard-to-Invert Leakage. J. Cryptol. 29(2): 422-455 (2016) - [c5]Ivan Damgård, Kasper Damgård, Kurt Nielsen
Confidential Benchmarking Based on Multiparty Computation. Financial Cryptography 2016: 169-187 - 2015
- [i7]Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, Nigel P. Smart:
High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer. IACR Cryptol. ePrint Arch. 2015: 472 (2015) - [i6]Ivan Damgård, Kasper Damgård, Kurt Nielsen, Peter Sebastian Nordholt, Tomas Toft:
Confidential Benchmarking based on Multiparty Computation. IACR Cryptol. ePrint Arch. 2015: 1006 (2015) - 2013
- [c4]Tore Kasper Frederiksen, Thomas Pelle Jakobsen, Jesper Buus Nielsen
MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions. EUROCRYPT 2013: 537-556 - [i5]Tore Kasper Frederiksen, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi:
MiniLEGO: Efficient Secure Two-Party Computation From General Assumptions. IACR Cryptol. ePrint Arch. 2013: 155 (2013) - 2012
- [c3]Sebastian Faust, Carmit Hazay
Signature Schemes Secure against Hard-to-Invert Leakage. ASIACRYPT 2012: 98-115 - [c2]Jesper Buus Nielsen
A New Approach to Practical Active-Secure Two-Party Computation. CRYPTO 2012: 681-700 - [i4]Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra:
A New Approach to Practical Active-Secure Two-Party Computation. CoRR abs/1202.3052 (2012) - [i3]Sebastian Faust, Carmit Hazay, Jesper Buus Nielsen, Peter Sebastian Nordholt, Angela Zottarel:
Signature Schemes Secure against Hard-to-Invert Leakage. IACR Cryptol. ePrint Arch. 2012: 45 (2012) - 2011
- [c1]Rikke Bendlin, Jesper Buus Nielsen
Lower and Upper Bounds for Deniable Public-Key Encryption. ASIACRYPT 2011: 125-142 - [i2]Rikke Bendlin, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi:
Lower and Upper Bounds for Deniable Public-Key Encryption. IACR Cryptol. ePrint Arch. 2011: 46 (2011) - [i1]Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra:
A New Approach to Practical Active-Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2011: 91 (2011)
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-25 05:57 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: