Efficient fully simulatable oblivious transfer from the McEliece assumptions. - Bernardo Machado David; Anderson C. A. Nascimento (ITW, 2011)

Universally Composable Private Proximity Testing. - Rafael Tonicelli; Bernardo Machado David; Vinícius de Morais Alves (ProvSec, 2011)

A Framework for Secure Single Sign-On. - Bernardo Machado David; Anderson C. A. Nascimento; Rafael Tonicelli (IACR Cryptol. ePrint Arch., 2011)

Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions. - Bernardo Machado David; Anderson C. A. Nascimento; Jörn Müller-Quade (ICITS, 2012)

Efficient Fully Simulatable Oblivious Transfer from the McEliece Assumptions. - Bernardo Machado David; Anderson C. A. Nascimento; Rafael T. de Sousa Jr. (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012)

Universally Composable Oblivious Transfer Based on a Variant of LPN. - Bernardo David; Rafael Dowsley; Anderson C. A. Nascimento (CANS, 2014)

Additively Homomorphic UC commitments with Optimal Amortized Overhead. - Ignacio Cascudo; Ivan Damgård; Bernardo David; Irene Giacomelli; Jesper Buus Nielsen; Roberto Trifiletti (IACR Cryptol. ePrint Arch., 2014)

Compact VSS and Efficient Homomorphic UC Commitments. - Ivan Damgård; Bernardo David; Irene Giacomelli; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2014)

Efficient Unconditionally Secure Comparison and Privacy Preserving Machine Learning Classification Protocols. - Bernardo Machado David; Rafael Dowsley; Raj S. Katti; Anderson C. A. Nascimento (ProvSec, 2015)

Tagged One-Time Signatures: Tight Security and Optimal Tag Size. - Masayuki Abe; Bernardo David; Markulf Kohlweiss; Ryo Nishimaki; Miyako Ohkubo (IACR Cryptol. ePrint Arch., 2015)

Generalizing Efficient Multiparty Computation. - Bernardo David; Ryo Nishimaki; Samuel Ranellucci; Alain Tapp (IACR Cryptol. ePrint Arch., 2015)

Rate-1, Linear Time and Additively Homomorphic UC Commitments. - Ignacio Cascudo; Ivan Damgård; Bernardo David; Nico Döttling; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2016)

A Provably Secure Proof-of-Stake Blockchain Protocol. - Aggelos Kiayias; Ioannis Konstantinou; Alexander Russell; Bernardo David; Roman Oliynykov (IACR Cryptol. ePrint Arch., 2016)

Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions. - Masayuki Abe; Melissa Chase; Bernardo David; Markulf Kohlweiss; Ryo Nishimaki; Miyako Ohkubo (J. Cryptol., 2016)

Unconditionally Secure, Universally Composable Privacy Preserving Linear Algebra. - Bernardo Machado David; Rafael Dowsley; Jeroen van de Graaf; Davidson Marques; Anderson C. A. Nascimento; Adriana C. B. Pinto (IEEE Trans. Inf. Forensics Secur., 2016)

Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. - Aggelos Kiayias; Alexander Russell; Bernardo David; Roman Oliynykov (CRYPTO (1), 2017)

A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM. - Paulo S. L. M. Barreto; Bernardo David; Rafael Dowsley; Kirill Morozov; Anderson C. A. Nascimento (IACR Cryptol. ePrint Arch., 2017)

SCRAPE: Scalable Randomness Attested by Public Entities. - Ignacio Cascudo; Bernardo David (IACR Cryptol. ePrint Arch., 2017)

Kaleidoscope: An Efficient Poker Protocol with Payment Distribution and Penalty Enforcement. - Bernardo David; Rafael Dowsley; Mario Larangeira (IACR Cryptol. ePrint Arch., 2017)

Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol. - Bernardo Machado David; Peter Gazi; Aggelos Kiayias; Alexander Russell (IACR Cryptol. ePrint Arch., 2017)

Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. - Bernardo David; Peter Gazi; Aggelos Kiayias; Alexander Russell (EUROCRYPT (2), 2018)

MARS: Monetized Ad-hoc Routing System (A Position Paper). - Bernardo David; Rafael Dowsley; Mario Larangeira (CRYBLOCK@MobiSys, 2018)

Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort. - Carsten Baum; Bernardo David; Rafael Dowsley (IACR Cryptol. ePrint Arch., 2018)

Efficient UC Commitment Extension with Homomorphism for Free (and Applications). - Ignacio Cascudo; Ivan Damgård; Bernardo David; Nico Döttling; Rafael Dowsley; Irene Giacomelli (IACR Cryptol. ePrint Arch., 2018)

ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement. - Bernardo David; Rafael Dowsley; Mario Larangeira (IACR Cryptol. ePrint Arch., 2018)

21 - Bringing Down the Complexity: Fast Composable Protocols for Card Games Without Secret State. - Bernardo David; Rafael Dowsley; Mario Larangeira (IACR Cryptol. ePrint Arch., 2018)

Insured MPC: Efficient Secure Computation with Financial Penalties. - Carsten Baum; Bernardo David; Rafael Dowsley (Financial Cryptography, 2020)

A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols. - Carsten Baum; Bernardo David; Rafael Dowsley (IACR Cryptol. ePrint Arch., 2020)

TARDIS: Time And Relative Delays In Simulation. - Carsten Baum; Bernardo David; Rafael Dowsley; Jesper Buus Nielsen; Sabine Oechsner (IACR Cryptol. ePrint Arch., 2020)

CRAFT: Composable Randomness and Almost Fairness from Time. - Carsten Baum; Bernardo David; Rafael Dowsley; Ravi Kishore; Jesper Buus Nielsen; Sabine Oechsner (IACR Cryptol. ePrint Arch., 2020)

ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing. - Ignacio Cascudo; Bernardo David (IACR Cryptol. ePrint Arch., 2020)

Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model. - Bernardo David; Rafael Dowsley (IACR Cryptol. ePrint Arch., 2020)

TARDIS: A Foundation of Time-Lock Puzzles in UC. - Carsten Baum; Bernardo David; Rafael Dowsley; Jesper Buus Nielsen; Sabine Oechsner (EUROCRYPT (3), 2021)

SoK: Mitigation of Front-running in Decentralized Finance. - Carsten Baum; James Hsin-yu Chiang; Bernardo David; Tore Kasper Frederiksen; Lorenzo Gentile (IACR Cryptol. ePrint Arch., 2021)

P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange. - Carsten Baum; Bernardo David; Tore Kasper Frederiksen (IACR Cryptol. ePrint Arch., 2021)

Encryption to the Future: A Paradigm for Sending Secret Messages to Future (Anonymous) Committees. - Matteo Campanelli; Bernardo David; Hamidreza Khoshakhlagh; Anders K. Kristensen; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2021)

Mt. Random: Multi-Tiered Randomness Beacons. - Ignacio Cascudo; Bernardo David; Omer Shlomovits; Denis Varlakov (IACR Cryptol. ePrint Arch., 2021)

FAST: Fair Auctions via Secret Transactions. - Bernardo David; Lorenzo Gentile; Mohsen Pourpouneh (IACR Cryptol. ePrint Arch., 2021)

GearBox: An Efficient UC Sharded Ledger Leveraging the Safety-Liveness Dichotomy. - Bernardo David; Bernardo Magri; Christian Matt 002; Jesper Buus Nielsen; Daniel Tschudi (IACR Cryptol. ePrint Arch., 2021)

Encryption to the Future - A Paradigm for Sending Secret Messages to Future (Anonymous) Committees. - Matteo Campanelli; Bernardo David; Hamidreza Khoshakhlagh; Anders Konring; Jesper Buus Nielsen (ASIACRYPT (3), 2022)

GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness Dichotomy. - Bernardo David; Bernardo Magri; Christian Matt 002; Jesper Buus Nielsen; Daniel Tschudi (CCS, 2022)

(Public) Verifiability for Composable Protocols Without Adaptivity or Zero-Knowledge. - Carsten Baum; Bernardo David; Rafael Dowsley (ProvSec, 2022)

Eagle: Efficient Privacy Preserving Smart Contracts. - Carsten Baum; James Hsin-yu Chiang; Bernardo David; Tore Kasper Frederiksen (IACR Cryptol. ePrint Arch., 2022)

YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO Model. - Ignacio Cascudo; Bernardo David; Lydia Garms; Anders Konring (IACR Cryptol. ePrint Arch., 2022)

FairPoS: Input Fairness in Proof-of-Stake with Adaptive Security. - James Hsin-yu Chiang; Bernardo David; Ittay Eyal; Tiantian Gong (IACR Cryptol. ePrint Arch., 2022)

FairPoS: Input Fairness in Permissionless Consensus. - James Hsin-yu Chiang; Bernardo David; Ittay Eyal; Tiantian Gong (AFT, 2023)

Perfect MPC over Layered Graphs. - Bernardo David; Giovanni Deligios; Aarushi Goel; Yuval Ishai; Anders Konring; Eyal Kushilevitz; Chen-Da Liu-Zhang; Varun Narayanan (CRYPTO (1), 2023)

A Decentralized Information Marketplace Preserving Input and Output Privacy. - Steven Golob; Sikha Pentyala; Rafael Dowsley; Bernardo David; Mario Larangeira; Martine De Cock; Anderson C. A. Nascimento (DEC@SIGMOD, 2023)

Local Differential Privacy in Voting. - Bernardo David; Rosario Giustolisi; Victor Mortensen; Morten Pedersen (ITASEC, 2023)

CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time. - Carsten Baum; Bernardo David; Rafael Dowsley; Ravi Kishore; Jesper Buus Nielsen; Sabine Oechsner (Public Key Cryptography (1), 2023)

SoK: Privacy-Enhancing Technologies in Finance. - Carsten Baum; James Hsin-yu Chiang; Bernardo David; Tore Kasper Frederiksen (IACR Cryptol. ePrint Arch., 2023)

CaSCaDE: (Time-Based) Cryptography from Space Communications DElay. - Carsten Baum; Bernardo David; Elena Pagnin; Akira Takahashi 002 (IACR Cryptol. ePrint Arch., 2023)

PAPR: Publicly Auditable Privacy Revocation for Anonymous Credentials. - Joakim Brorsson; Bernardo David; Lorenzo Gentile; Elena Pagnin; Paul Stankovski Wagner (IACR Cryptol. ePrint Arch., 2023)

Publicly Verifiable Secret Sharing over Class Groups and Applications to DKG and YOSO. - Ignacio Cascudo; Bernardo David (IACR Cryptol. ePrint Arch., 2023)

Correlated-Output-Differential-Privacy and Applications to Dark Pools. - James Hsin-yu Chiang; Bernardo David; Mariana Gama; Christian Janos Lebeda (IACR Cryptol. ePrint Arch., 2023)

Updatable Privacy-Preserving Blueprints. - Bernardo David; Felix Engelmann; Tore Kasper Frederiksen; Markulf Kohlweiss; Elena Pagnin; Mikhail Volkhov (IACR Cryptol. ePrint Arch., 2023)

Perfect MPC over Layered Graphs. - Bernardo David; Anders Konring; Yuval Ishai; Eyal Kushilevitz; Varun Narayanan (IACR Cryptol. ePrint Arch., 2023)

Consistency-or-Die: Consistency for Key Transparency. - Joakim Brorsson; Elena Pagnin; Bernardo David; Paul Stankovski Wagner (IACR Cryptol. ePrint Arch., 2024)

Detecting Rogue Decryption in (Threshold) Encryption via Self-Incriminating Proofs. - James Hsin-yu Chiang; Bernardo David; Tore Kasper Frederiksen; Arup Mondal; Esra Yeniaras (IACR Cryptol. ePrint Arch., 2024)

MUSEN: Aggregatable Key-Evolving Verifiable Random Functions and Applications. - Bernardo David; Rafael Dowsley; Anders Konring; Mario Larangeira (IACR Cryptol. ePrint Arch., 2024)

Universally Composable Interactive and Ordered Multi-Signatures. - Carsten Baum; Bernardo David; Elena Pagnin; Akira Takahashi 002 (IACR Cryptol. ePrint Arch., 2025)

Pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer. - Orestis Alpos; Bernardo David; Dionysis Zindros (CoRR, 2025)

An overview of the efficiency and censorship-resistance guarantees of widely-used consensus protocols. - Orestis Alpos; Bernardo David; Nikolas Kamarinakis; Dionysis Zindros (CoRR, 2025)