default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValerio Pastro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[i11]Valerie Chen, Valerio Pastro, Mariana Raykova:
Secure Computation for Machine Learning With SPDZ. CoRR abs/1901.00329 (2019)- [i10]Allison Bishop, Lucas Kowalczyk, Tal Malkin, Valerio Pastro, Mariana Raykova, Kevin Shi:
In Pursuit of Clarity In Obfuscation. IACR Cryptol. ePrint Arch. 2019: 463 (2019) - 2018
- [c8]Allison Bishop, Lucas Kowalczyk, Tal Malkin, Valerio Pastro, Mariana Raykova, Kevin Shi:
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards. CRYPTO (3) 2018: 731-752 - [c7]Marcel Keller
, Valerio Pastro, Dragos Rotaru:
Overdrive: Making SPDZ Great Again. EUROCRYPT (3) 2018: 158-189 - [i9]Allison Bishop, Lucas Kowalczyk, Tal Malkin, Valerio Pastro, Mariana Raykova, Kevin Shi:
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards. IACR Cryptol. ePrint Arch. 2018: 210 (2018) - 2017
- [i8]Morten Dahl, Valerio Pastro, Mathieu Poumeyrol:
Private Data Aggregation on a Budget. IACR Cryptol. ePrint Arch. 2017: 643 (2017) - [i7]Marcel Keller, Valerio Pastro, Dragos Rotaru:
Overdrive: Making SPDZ Great Again. IACR Cryptol. ePrint Arch. 2017: 1230 (2017) - 2016
- [c6]Allison Bishop, Valerio Pastro, Rajmohan Rajaraman, Daniel Wichs:
Essentially Optimal Robust Secret Sharing with Maximal Corruptions. EUROCRYPT (1) 2016: 58-86 - [c5]Allison Bishop, Valerio Pastro:
Robust Secret Sharing Schemes Against Local Adversaries. Public Key Cryptography (2) 2016: 327-356 - 2015
- [i6]Allison Bishop, Valerio Pastro, Rajmohan Rajaraman, Daniel Wichs:
Essentially Optimal Robust Secret Sharing with Maximal Corruptions. IACR Cryptol. ePrint Arch. 2015: 1032 (2015) - 2014
- [c4]Dario Fiore, Rosario Gennaro, Valerio Pastro:
Efficiently Verifiable Computation on Encrypted Data. CCS 2014: 844-855 - [i5]Rosario Gennaro, Valerio Pastro:
Verifiable Computation over Encrypted Data in the Presence of Verification Queries. IACR Cryptol. ePrint Arch. 2014: 202 (2014) - [i4]Allison Bishop Lewko, Valerio Pastro:
Robust Secret Sharing Schemes Against Local Adversaries. IACR Cryptol. ePrint Arch. 2014: 909 (2014) - 2013
- [c3]Ivan Damgård, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, Nigel P. Smart:
Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits. ESORICS 2013: 1-18 - 2012
- [c2]Ivan Damgård, Valerio Pastro, Nigel P. Smart, Sarah Zakarias:
Multiparty Computation from Somewhat Homomorphic Encryption. CRYPTO 2012: 643-662 - [c1]Ronald Cramer, Ivan Damgård, Valerio Pastro:
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. ICITS 2012: 62-79 - [i3]Ivan Damgård, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, Nigel P. Smart:
Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits. IACR Cryptol. ePrint Arch. 2012: 642 (2012) - 2011
- [i2]Ronald Cramer, Ivan Damgård, Valerio Pastro:
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. IACR Cryptol. ePrint Arch. 2011: 301 (2011) - [i1]Ivan Damgård, Valerio Pastro, Nigel P. Smart, Sarah Zakarias:
Multiparty Computation from Somewhat Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2011: 535 (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:43 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:
