default search action
Roberto Trifiletti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c5]Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, Roberto Trifiletti:
DUPLO: Unifying Cut-and-Choose for Garbled Circuits. CCS 2017: 3-20 - [c4]Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges, Roberto Trifiletti:
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation. CCS 2017: 2263-2276 - [c3]Jesper Buus Nielsen, Thomas Schneider, Roberto Trifiletti:
Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. NDSS 2017 - [i7]Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, Roberto Trifiletti:
DUPLO: Unifying Cut-and-Choose for Garbled Circuits. IACR Cryptol. ePrint Arch. 2017: 344 (2017) - [i6]Peter Rindal, Roberto Trifiletti:
SplitCommit: Implementing and Analyzing Homomorphic UC Commitments. IACR Cryptol. ePrint Arch. 2017: 407 (2017) - [i5]Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges, Roberto Trifiletti:
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation. IACR Cryptol. ePrint Arch. 2017: 790 (2017) - 2016
- [c2]Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen
, Roberto Trifiletti:
On the Complexity of Additively Homomorphic UC Commitments. TCC (A1) 2016: 542-565 - [i4]Jesper Buus Nielsen, Thomas Schneider, Roberto Trifiletti:
Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. IACR Cryptol. ePrint Arch. 2016: 1069 (2016) - 2015
- [c1]Ignacio Cascudo
Additively Homomorphic UC Commitments with Optimal Amortized Overhead. Public Key Cryptography 2015: 495-515 - [i3]Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Roberto Trifiletti:
TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation. IACR Cryptol. ePrint Arch. 2015: 309 (2015) - [i2]Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Roberto Trifiletti:
On the Complexity of Additively Homomorphic UC Commitments. IACR Cryptol. ePrint Arch. 2015: 694 (2015) - 2014
- [i1]Ignacio Cascudo, Ivan Damgård, Bernardo David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti:
Additively Homomorphic UC commitments with Optimal Amortized Overhead. IACR Cryptol. ePrint Arch. 2014: 829 (2014)
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:36 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: