default search action
Bernardo Machado David
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c43]Ignacio Cascudo, Bernardo David:
Publicly Verifiable Secret Sharing Over Class Groups and Applications to DKG and YOSO. EUROCRYPT (5) 2024: 216-248 - [c42]Carsten Baum, Bernardo Machado David, Elena Pagnin, Akira Takahashi:
CaSCaDE: (Time-Based) Cryptography from Space Communications DElay. SCN (1) 2024: 252-274 - [c41]Bernardo David, Rafael Dowsley, Anders Konring, Mario Larangeira:
MUSEN: Aggregatable Key-Evolving Verifiable Random Functions and Applications. SCN (2) 2024: 317-337 - [i41]Bernardo David, Rafael Dowsley, Anders Konring, Mario Larangeira:
MUSEN: Aggregatable Key-Evolving Verifiable Random Functions and Applications. IACR Cryptol. ePrint Arch. 2024: 628 (2024) - [i40]James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen, Arup Mondal, Esra Yeniaras:
Detecting Rogue Decryption in (Threshold) Encryption via Self-Incriminating Proofs. IACR Cryptol. ePrint Arch. 2024: 794 (2024) - [i39]Joakim Brorsson, Elena Pagnin, Bernardo David, Paul Stankovski Wagner:
Consistency-or-Die: Consistency for Key Transparency. IACR Cryptol. ePrint Arch. 2024: 879 (2024) - 2023
- [c40]Ignacio Cascudo, Bernardo David, Omer Shlomovits, Denis Varlakov:
Mt. Random: Multi-tiered Randomness Beacons. ACNS 2023: 645-674 - [c39]James Hsin-yu Chiang, Bernardo David, Ittay Eyal, Tiantian Gong:
FairPoS: Input Fairness in Permissionless Consensus. AFT 2023: 10:1-10:23 - [c38]James Hsin-yu Chiang, Bernardo David, Mariana Gama, Christian Janos Lebeda:
Correlated-Output Differential Privacy and Applications to Dark Pools. AFT 2023: 11:1-11:23 - [c37]Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen:
SoK: Privacy-Enhancing Technologies in Finance. AFT 2023: 12:1-12:30 - [c36]Bernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushilevitz, Chen-Da Liu-Zhang, Varun Narayanan:
Perfect MPC over Layered Graphs. CRYPTO (1) 2023: 360-392 - [c35]Joakim Brorsson, Bernardo David, Lorenzo Gentile, Elena Pagnin, Paul Stankovski Wagner:
PAPR: Publicly Auditable Privacy Revocation for Anonymous Credentials. CT-RSA 2023: 163-190 - [c34]Steven Golob, Sikha Pentyala, Rafael Dowsley, Bernardo David, Mario Larangeira, Martine De Cock, Anderson C. A. Nascimento:
A Decentralized Information Marketplace Preserving Input and Output Privacy. DEC@SIGMOD 2023: 1-6 - [c33]Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen:
Eagle: Efficient Privacy Preserving Smart Contracts. FC (1) 2023: 270-288 - [c32]Bernardo David, Rosario Giustolisi, Victor Mortensen, Morten Pedersen:
Local Differential Privacy in Voting. ITASEC 2023 - [c31]Carsten Baum, Bernardo David, Rafael Dowsley, Ravi Kishore, Jesper Buus Nielsen, Sabine Oechsner:
CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time. Public Key Cryptography (1) 2023: 439-470 - [i38]Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen:
SoK: Privacy-Enhancing Technologies in Finance. IACR Cryptol. ePrint Arch. 2023: 122 (2023) - [i37]Joakim Brorsson, Bernardo David, Lorenzo Gentile, Elena Pagnin, Paul Stankovski Wagner:
PAPR: Publicly Auditable Privacy Revocation for Anonymous Credentials. IACR Cryptol. ePrint Arch. 2023: 137 (2023) - [i36]Bernardo David, Anders Konring, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan:
Perfect MPC over Layered Graphs. IACR Cryptol. ePrint Arch. 2023: 330 (2023) - [i35]Carsten Baum, Bernardo David, Elena Pagnin, Akira Takahashi:
CaSCaDE: (Time-Based) Cryptography from Space Communications DElay. IACR Cryptol. ePrint Arch. 2023: 405 (2023) - [i34]James Hsin-yu Chiang, Bernardo David, Mariana Gama, Christian Janos Lebeda:
Correlated-Output-Differential-Privacy and Applications to Dark Pools. IACR Cryptol. ePrint Arch. 2023: 943 (2023) - [i33]Ignacio Cascudo, Bernardo David:
Publicly Verifiable Secret Sharing over Class Groups and Applications to DKG and YOSO. IACR Cryptol. ePrint Arch. 2023: 1651 (2023) - [i32]Bernardo David, Felix Engelmann, Tore Kasper Frederiksen, Markulf Kohlweiss, Elena Pagnin, Mikhail Volkhov:
Updatable Privacy-Preserving Blueprints. IACR Cryptol. ePrint Arch. 2023: 1787 (2023) - 2022
- [c30]Bernardo David, Lorenzo Gentile, Mohsen Pourpouneh:
FAST: Fair Auctions via Secret Transactions. ACNS 2022: 727-747 - [c29]Matteo Campanelli, Bernardo David, Hamidreza Khoshakhlagh, Anders Konring, Jesper Buus Nielsen:
Encryption to the Future - A Paradigm for Sending Secret Messages to Future (Anonymous) Committees. ASIACRYPT (3) 2022: 151-180 - [c28]Ignacio Cascudo, Bernardo David, Lydia Garms, Anders Konring:
YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO Model. ASIACRYPT (1) 2022: 651-680 - [c27]Bernardo David, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Daniel Tschudi:
GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness Dichotomy. CCS 2022: 683-696 - [c26]Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen, Lorenzo Gentile:
SoK: Mitigation of Front-Running in Decentralized Finance. Financial Cryptography Workshops 2022: 250-271 - [c25]Carsten Baum, Bernardo David, Rafael Dowsley:
(Public) Verifiability for Composable Protocols Without Adaptivity or Zero-Knowledge. ProvSec 2022: 249-272 - [i31]Ignacio Cascudo, Bernardo David, Lydia Garms, Anders Konring:
YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO Model. IACR Cryptol. ePrint Arch. 2022: 242 (2022) - [i30]Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen:
Eagle: Efficient Privacy Preserving Smart Contracts. IACR Cryptol. ePrint Arch. 2022: 1435 (2022) - [i29]James Hsin-yu Chiang, Bernardo David, Ittay Eyal, Tiantian Gong:
FairPoS: Input Fairness in Proof-of-Stake with Adaptive Security. IACR Cryptol. ePrint Arch. 2022: 1442 (2022) - 2021
- [c24]Carsten Baum, Bernardo David, Tore Kasper Frederiksen:
P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange. ACNS (1) 2021: 163-194 - [c23]Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, Sabine Oechsner:
TARDIS: A Foundation of Time-Lock Puzzles in UC. EUROCRYPT (3) 2021: 429-459 - [i28]Bernardo David, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, Daniel Tschudi:
GearBox: An Efficient UC Sharded Ledger Leveraging the Safety-Liveness Dichotomy. IACR Cryptol. ePrint Arch. 2021: 211 (2021) - [i27]Bernardo David, Lorenzo Gentile, Mohsen Pourpouneh:
FAST: Fair Auctions via Secret Transactions. IACR Cryptol. ePrint Arch. 2021: 264 (2021) - [i26]Carsten Baum, Bernardo David, Tore Kasper Frederiksen:
P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange. IACR Cryptol. ePrint Arch. 2021: 283 (2021) - [i25]Ignacio Cascudo, Bernardo David, Omer Shlomovits, Denis Varlakov:
Mt. Random: Multi-Tiered Randomness Beacons. IACR Cryptol. ePrint Arch. 2021: 1096 (2021) - [i24]Matteo Campanelli, Bernardo David, Hamidreza Khoshakhlagh, Anders K. Kristensen, Jesper Buus Nielsen:
Encryption to the Future: A Paradigm for Sending Secret Messages to Future (Anonymous) Committees. IACR Cryptol. ePrint Arch. 2021: 1423 (2021) - [i23]Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen, Lorenzo Gentile:
SoK: Mitigation of Front-running in Decentralized Finance. IACR Cryptol. ePrint Arch. 2021: 1628 (2021) - 2020
- [c22]Ignacio Cascudo, Bernardo David:
ALBATROSS: Publicly AttestabLe BATched Randomness Based On Secret Sharing. ASIACRYPT (3) 2020: 311-341 - [c21]Bernardo David, Rafael Dowsley:
Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model. CANS 2020: 462-481 - [c20]Carsten Baum, Bernardo David, Rafael Dowsley:
Insured MPC: Efficient Secure Computation with Financial Penalties. Financial Cryptography 2020: 404-420 - [i22]Carsten Baum, Bernardo David, Rafael Dowsley:
A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2020: 207 (2020) - [i21]Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, Sabine Oechsner:
TARDIS: Time And Relative Delays In Simulation. IACR Cryptol. ePrint Arch. 2020: 537 (2020) - [i20]Ignacio Cascudo, Bernardo David:
ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing. IACR Cryptol. ePrint Arch. 2020: 644 (2020) - [i19]Carsten Baum, Bernardo David, Rafael Dowsley, Ravi Kishore, Jesper Buus Nielsen, Sabine Oechsner:
CRAFT: Composable Randomness and Almost Fairness from Time. IACR Cryptol. ePrint Arch. 2020: 784 (2020) - [i18]Bernardo David, Rafael Dowsley:
Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model. IACR Cryptol. ePrint Arch. 2020: 1291 (2020)
2010 – 2019
- 2019
- [c19]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Rafael Dowsley, Irene Giacomelli:
Efficient UC Commitment Extension with Homomorphism for Free (and Applications). ASIACRYPT (2) 2019: 606-635 - [c18]Bernardo David, Rafael Dowsley, Mario Larangeira:
ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement. Financial Cryptography 2019: 282-300 - 2018
- [c17]Bernardo David, Rafael Dowsley, Mario Larangeira:
21 - Bringing Down the Complexity: Fast Composable Protocols for Card Games Without Secret State. ACISP 2018: 45-63 - [c16]Bernardo David, Peter Gazi, Aggelos Kiayias, Alexander Russell:
Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. EUROCRYPT (2) 2018: 66-98 - [c15]Bernardo David, Rafael Dowsley, Mario Larangeira:
Kaleidoscope: An Efficient Poker Protocol with Payment Distribution and Penalty Enforcement. Financial Cryptography 2018: 500-519 - [c14]Bernardo David, Rafael Dowsley, Mario Larangeira:
MARS: Monetized Ad-hoc Routing System (A Position Paper). CRYBLOCK@MobiSys 2018: 82-86 - [i17]Bernardo David, Rafael Dowsley, Mario Larangeira:
ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement. IACR Cryptol. ePrint Arch. 2018: 157 (2018) - [i16]Bernardo David, Rafael Dowsley, Mario Larangeira:
21 - Bringing Down the Complexity: Fast Composable Protocols for Card Games Without Secret State. IACR Cryptol. ePrint Arch. 2018: 303 (2018) - [i15]Carsten Baum, Bernardo David, Rafael Dowsley:
Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort. IACR Cryptol. ePrint Arch. 2018: 942 (2018) - [i14]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Rafael Dowsley, Irene Giacomelli:
Efficient UC Commitment Extension with Homomorphism for Free (and Applications). IACR Cryptol. ePrint Arch. 2018: 983 (2018) - 2017
- [c13]Ignacio Cascudo, Bernardo David:
SCRAPE: Scalable Randomness Attested by Public Entities. ACNS 2017: 537-556 - [c12]Aggelos Kiayias, Alexander Russell, Bernardo David, Roman Oliynykov:
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. CRYPTO (1) 2017: 357-388 - [i13]Paulo S. L. M. Barreto, Bernardo David, Rafael Dowsley, Kirill Morozov, Anderson C. A. Nascimento:
A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM. CoRR abs/1710.08256 (2017) - [i12]Ignacio Cascudo, Bernardo David:
SCRAPE: Scalable Randomness Attested by Public Entities. IACR Cryptol. ePrint Arch. 2017: 216 (2017) - [i11]Bernardo Machado David, Peter Gazi, Aggelos Kiayias, Alexander Russell:
Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol. IACR Cryptol. ePrint Arch. 2017: 573 (2017) - [i10]Bernardo David, Rafael Dowsley, Mario Larangeira:
Kaleidoscope: An Efficient Poker Protocol with Payment Distribution and Penalty Enforcement. IACR Cryptol. ePrint Arch. 2017: 899 (2017) - [i9]Paulo S. L. M. Barreto, Bernardo David, Rafael Dowsley, Kirill Morozov, Anderson C. A. Nascimento:
A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM. IACR Cryptol. ePrint Arch. 2017: 993 (2017) - 2016
- [j3]Masayuki Abe, Melissa Chase, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo:
Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions. J. Cryptol. 29(4): 833-878 (2016) - [j2]Bernardo Machado David, Rafael Dowsley, Jeroen van de Graaf, Davidson Marques, Anderson C. A. Nascimento, Adriana C. B. Pinto:
Unconditionally Secure, Universally Composable Privacy Preserving Linear Algebra. IEEE Trans. Inf. Forensics Secur. 11(1): 59-73 (2016) - [c11]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Jesper Buus Nielsen:
Rate-1, Linear Time and Additively Homomorphic UC Commitments. CRYPTO (3) 2016: 179-207 - [i8]Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Jesper Buus Nielsen:
Rate-1, Linear Time and Additively Homomorphic UC Commitments. IACR Cryptol. ePrint Arch. 2016: 137 (2016) - [i7]Aggelos Kiayias, Ioannis Konstantinou, Alexander Russell, Bernardo David, Roman Oliynykov:
A Provably Secure Proof-of-Stake Blockchain Protocol. IACR Cryptol. ePrint Arch. 2016: 889 (2016) - 2015
- [c10]Bernardo Machado David, Ryo Nishimaki, Samuel Ranellucci, Alain Tapp:
Generalizing Efficient Multiparty Computation. ICITS 2015: 15-32 - [c9]Ignacio Cascudo, Ivan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti:
Additively Homomorphic UC Commitments with Optimal Amortized Overhead. Public Key Cryptography 2015: 495-515 - [c8]Bernardo Machado David, Rafael Dowsley, Raj S. Katti, Anderson C. A. Nascimento:
Efficient Unconditionally Secure Comparison and Privacy Preserving Machine Learning Classification Protocols. ProvSec 2015: 354-367 - [i6]Bernardo David, Ryo Nishimaki, Samuel Ranellucci, Alain Tapp:
Generalizing Efficient Multiparty Computation. IACR Cryptol. ePrint Arch. 2015: 135 (2015) - [i5]Masayuki Abe, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo:
Tagged One-Time Signatures: Tight Security and Optimal Tag Size. IACR Cryptol. ePrint Arch. 2015: 311 (2015) - 2014
- [c7]Ivan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus Nielsen:
Compact VSS and Efficient Homomorphic UC Commitments. ASIACRYPT (2) 2014: 213-232 - [c6]Bernardo David, Rafael Dowsley, Anderson C. A. Nascimento:
Universally Composable Oblivious Transfer Based on a Variant of LPN. CANS 2014: 143-158 - [i4]Ivan Damgård, Bernardo David, Irene Giacomelli, Jesper Buus Nielsen:
Compact VSS and Efficient Homomorphic UC Commitments. IACR Cryptol. ePrint Arch. 2014: 370 (2014) - [i3]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) - 2013
- [c5]Masayuki Abe, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo:
Tagged One-Time Signatures: Tight Security and Optimal Tag Size. Public Key Cryptography 2013: 312-331 - 2012
- [j1]Bernardo Machado David, Anderson C. A. Nascimento, Rafael T. de Sousa Jr.:
Efficient Fully Simulatable Oblivious Transfer from the McEliece Assumptions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(11): 2059-2066 (2012) - [c4]Masayuki Abe, Melissa Chase, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo:
Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions. ASIACRYPT 2012: 4-24 - [c3]Bernardo Machado David, Anderson C. A. Nascimento, Jörn Müller-Quade:
Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions. ICITS 2012: 80-99 - [i2]Masayuki Abe, Melissa Chase, Bernardo David, Markulf Kohlweiss, Ryo Nishimaki, Miyako Ohkubo:
Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions. IACR Cryptol. ePrint Arch. 2012: 285 (2012) - 2011
- [c2]Bernardo Machado David, Anderson C. A. Nascimento:
Efficient fully simulatable oblivious transfer from the McEliece assumptions. ITW 2011: 638-642 - [c1]Rafael Tonicelli, Bernardo Machado David, Vinícius de Morais Alves:
Universally Composable Private Proximity Testing. ProvSec 2011: 222-239 - [i1]Bernardo Machado David, Anderson C. A. Nascimento, Rafael Tonicelli:
A Framework for Secure Single Sign-On. IACR Cryptol. ePrint Arch. 2011: 246 (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-09-20 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint