default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEnrique Larraia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Enrique Larraia, Mehmet Sabir Kiraz, Owen Vaughan:
How to Redact the Bitcoin Backbone Protocol. ICBC 2024: 485-493- [i14]Mehmet Sabir Kiraz, Enrique Larraia, Owen Vaughan:
How to Redact the Bitcoin Backbone Protocol. IACR Cryptol. ePrint Arch. 2024: 813 (2024) - [i13]Federico Barbacovi, Enrique Larraia, Paul Germouty, Wei Zhang:
Practical Implementation of Pairing-Based zkSNARK in Bitcoin Script. IACR Cryptol. ePrint Arch. 2024: 1498 (2024) - 2023
- [c10]Mehmet Sabir Kiraz
, Enrique Larraia, Owen Vaughan:
NFT Trades in Bitcoin with Off-Chain Receipts. ACNS Workshops 2023: 100-117 - [c9]Paul Germouty, Enrique Larraia, Wei Zhang:
Publicly Verifiable Auctions with Privacy. FC Workshops 2023: 420-438 - [i12]Paul Germouty, Enrique Larraia, Wei Zhang:
Publicly Verifiable Auctions with Privacy. IACR Cryptol. ePrint Arch. 2023: 608 (2023) - [i11]Mehmet Sabir Kiraz, Enrique Larraia, Owen Vaughan:
NFT Trades in Bitcoin with Off-chain Receipts. IACR Cryptol. ePrint Arch. 2023: 697 (2023) - [i10]Enrique Larraia, Owen Vaughan:
Private Timestamps and Selective Verification of Notarised Data on a Blockchain. IACR Cryptol. ePrint Arch. 2023: 1000 (2023) - 2022
- [i9]Enrique Larraia, Tamara Finogina, Núria Costa:
sVote with Control Components Voting Protocol. Computational Proof of Complete Verifiability and Privacy. IACR Cryptol. ePrint Arch. 2022: 1509 (2022) - 2021
- [j2]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. J. Cryptol. 34(3): 34 (2021) - [c8]Tamara Finogina, Javier Herranz, Enrique Larraia:
How (not) to Achieve both Coercion Resistance and Cast as Intended Verifiability in Remote eVoting. CANS 2021: 483-491 - 2020
- [j1]Martin R. Albrecht, Pooya Farshim, Shuai Han, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson:
Multilinear Maps from Obfuscation. J. Cryptol. 33(3): 1080-1113 (2020)
2010 – 2019
- 2018
- [c7]Pooya Farshim, Julia Hesse, Dennis Hofheinz, Enrique Larraia:
Graded Encoding Schemes from Obfuscation. Public Key Cryptography (2) 2018: 371-400 - [i8]Pooya Farshim, Julia Hesse, Dennis Hofheinz, Enrique Larraia:
Graded Encoding Schemes from Obfuscation. IACR Cryptol. ePrint Arch. 2018: 11 (2018) - 2017
- [c6]Martin R. Albrecht, Alex Davidson, Enrique Larraia:
Notes on GGH13 Without the Presence of Ideals. IMACC 2017: 135-158 - [i7]Martin R. Albrecht, Alex Davidson, Enrique Larraia, Alice Pellet-Mary:
Notes On GGH13 Without The Presence Of Ideals. IACR Cryptol. ePrint Arch. 2017: 906 (2017) - 2016
- [c5]Martin R. Albrecht, Pooya Farshim, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson:
Multilinear Maps from Obfuscation. TCC (A1) 2016: 446-473 - 2015
- [b1]Enrique Larraia de Vega:
Universally composable protocols for multi-party computation and oblivious transfer. University of Bristol, UK, 2015 - [i6]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) - [i5]Martin R. Albrecht, Pooya Farshim, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson:
Multilinear Maps from Obfuscation. IACR Cryptol. ePrint Arch. 2015: 780 (2015) - 2014
- [c4]Enrique Larraia, Emmanuela Orsini, Nigel P. Smart:
Dishonest Majority Multi-Party Computation for Binary Circuits. CRYPTO (2) 2014: 495-512 - [c3]Enrique Larraia:
Extending Oblivious Transfer Efficiently - or - How to Get Active Security with Constant Cryptographic Overhead. LATINCRYPT 2014: 368-386 - [i4]Enrique Larraia, Emmanuela Orsini, Nigel P. Smart:
Dishonest Majority Multi-Party Computation for Binary Circuits. IACR Cryptol. ePrint Arch. 2014: 101 (2014) - [i3]Enrique Larraia:
Extending Oblivious Transfer Efficiently, or - How to get active security with constant cryptographic overhead. IACR Cryptol. ePrint Arch. 2014: 692 (2014) - 2013
- [c2]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
- [c1]Ivan Damgård, Marcel Keller, Enrique Larraia, Christian Miles, Nigel P. Smart:
Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol. SCN 2012: 241-263 - [i2]Ivan Damgård, Marcel Keller, Enrique Larraia, Christian Miles, Nigel P. Smart:
Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol. IACR Cryptol. ePrint Arch. 2012: 262 (2012) - [i1]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)
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-10-17 20:30 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:
