Bernardo Machado David

Orcid: 0000-0002-1872-7799

According to our database1, Bernardo Machado David authored at least 57 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Perfect MPC over Layered Graphs.
IACR Cryptol. ePrint Arch., 2023

Updatable Privacy-Preserving Blueprints.
IACR Cryptol. ePrint Arch., 2023

Correlated-Output-Differential-Privacy and Applications to Dark Pools.
IACR Cryptol. ePrint Arch., 2023

Publicly Verifiable Secret Sharing over Class Groups and Applications to DKG and YOSO.
IACR Cryptol. ePrint Arch., 2023

PAPR: Publicly Auditable Privacy Revocation for Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2023

CaSCaDE: (Time-Based) Cryptography from Space Communications DElay.
IACR Cryptol. ePrint Arch., 2023

SoK: Privacy-Enhancing Technologies in Finance.
IACR Cryptol. ePrint Arch., 2023

CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Local Differential Privacy in Voting.
Proceedings of the Italian Conference on Cyber Security (ITASEC 2023), 2023

A Decentralized Information Marketplace Preserving Input and Output Privacy.
Proceedings of the Second ACM Data Economy Workshop, 2023

Perfect MPC over Layered Graphs.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

FairPoS: Input Fairness in Permissionless Consensus.
Proceedings of the 5th Conference on Advances in Financial Technologies, 2023

2022
FairPoS: Input Fairness in Proof-of-Stake with Adaptive Security.
IACR Cryptol. ePrint Arch., 2022

YOLO YOSO: Fast and Simple Encryption and Secret Sharing in the YOSO Model.
IACR Cryptol. ePrint Arch., 2022

Eagle: Efficient Privacy Preserving Smart Contracts.
IACR Cryptol. ePrint Arch., 2022

(Public) Verifiability for Composable Protocols Without Adaptivity or Zero-Knowledge.
Proceedings of the Provable and Practical Security, 2022

GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness Dichotomy.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Encryption to the Future - A Paradigm for Sending Secret Messages to Future (Anonymous) Committees.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
GearBox: An Efficient UC Sharded Ledger Leveraging the Safety-Liveness Dichotomy.
IACR Cryptol. ePrint Arch., 2021

FAST: Fair Auctions via Secret Transactions.
IACR Cryptol. ePrint Arch., 2021

Mt. Random: Multi-Tiered Randomness Beacons.
IACR Cryptol. ePrint Arch., 2021

Encryption to the Future: A Paradigm for Sending Secret Messages to Future (Anonymous) Committees.
IACR Cryptol. ePrint Arch., 2021

P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange.
IACR Cryptol. ePrint Arch., 2021

SoK: Mitigation of Front-running in Decentralized Finance.
IACR Cryptol. ePrint Arch., 2021

TARDIS: A Foundation of Time-Lock Puzzles in UC.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020
Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model.
IACR Cryptol. ePrint Arch., 2020

ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing.
IACR Cryptol. ePrint Arch., 2020

CRAFT: Composable Randomness and Almost Fairness from Time.
IACR Cryptol. ePrint Arch., 2020

TARDIS: Time And Relative Delays In Simulation.
IACR Cryptol. ePrint Arch., 2020

A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols.
IACR Cryptol. ePrint Arch., 2020

Insured MPC: Efficient Secure Computation with Financial Penalties.
Proceedings of the Financial Cryptography and Data Security, 2020

2018
21 - Bringing Down the Complexity: Fast Composable Protocols for Card Games Without Secret State.
IACR Cryptol. ePrint Arch., 2018

ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement.
IACR Cryptol. ePrint Arch., 2018

Efficient UC Commitment Extension with Homomorphism for Free (and Applications).
IACR Cryptol. ePrint Arch., 2018

Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort.
IACR Cryptol. ePrint Arch., 2018

MARS: Monetized Ad-hoc Routing System (A Position Paper).
Proceedings of the 1st Workshop on Cryptocurrencies and Blockchains for Distributed Systems, 2018

Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol.
IACR Cryptol. ePrint Arch., 2017

Kaleidoscope: An Efficient Poker Protocol with Payment Distribution and Penalty Enforcement.
IACR Cryptol. ePrint Arch., 2017

SCRAPE: Scalable Randomness Attested by Public Entities.
IACR Cryptol. ePrint Arch., 2017

A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM.
IACR Cryptol. ePrint Arch., 2017

Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Unconditionally Secure, Universally Composable Privacy Preserving Linear Algebra.
IEEE Trans. Inf. Forensics Secur., 2016

Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions.
J. Cryptol., 2016

A Provably Secure Proof-of-Stake Blockchain Protocol.
IACR Cryptol. ePrint Arch., 2016

Rate-1, Linear Time and Additively Homomorphic UC Commitments.
IACR Cryptol. ePrint Arch., 2016

2015
Generalizing Efficient Multiparty Computation.
IACR Cryptol. ePrint Arch., 2015

Tagged One-Time Signatures: Tight Security and Optimal Tag Size.
IACR Cryptol. ePrint Arch., 2015

Efficient Unconditionally Secure Comparison and Privacy Preserving Machine Learning Classification Protocols.
Proceedings of the Provable Security, 2015

2014
Compact VSS and Efficient Homomorphic UC Commitments.
IACR Cryptol. ePrint Arch., 2014

Additively Homomorphic UC commitments with Optimal Amortized Overhead.
IACR Cryptol. ePrint Arch., 2014

Universally Composable Oblivious Transfer Based on a Variant of LPN.
Proceedings of the Cryptology and Network Security - 13th International Conference, 2014

2012
Efficient Fully Simulatable Oblivious Transfer from the McEliece Assumptions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions.
Proceedings of the Information Theoretic Security - 6th International Conference, 2012

2011
A Framework for Secure Single Sign-On.
IACR Cryptol. ePrint Arch., 2011

Universally Composable Private Proximity Testing.
Proceedings of the Provable Security - 5th International Conference, 2011

Efficient fully simulatable oblivious transfer from the McEliece assumptions.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011


  Loading...