Bernardo David

Available identifiers

zbMath Open david.bernardo-machadoMaRDI QIDQ321313

List of research outcomes

Publication	Date of Publication	Type
CaSCaDE: (time-based) Cryptography from Space Communications DElay	2025-01-10	Paper
MUSEN: aggregatable key-evolving verifiable random functions and applications	2025-01-10	Paper
Publicly verifiable secret sharing over class groups and applications to DKG and YOSO	2024-11-13	Paper
Eagle: efficient privacy preserving smart contracts	2024-07-17	Paper
Perfect MPC over layered graphs	2024-02-02	Paper
CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime	2023-11-24	Paper
PAPR: publicly auditable privacy revocation for anonymous credentials	2023-10-04	Paper
YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model	2023-08-25	Paper
Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees	2023-08-25	Paper
(Public) verifiability for composable protocols without adaptivity or zero-knowledge	2023-07-21	Paper
ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing	2023-03-29	Paper
Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model	2023-03-22	Paper
FAST: fair auctions via secret transactions	2022-11-09	Paper
SCRAPE: Scalable Randomness Attested by Public Entities	2022-07-01	Paper
P2DEX: privacy-preserving decentralized cryptocurrency exchange	2022-03-21	Paper
TARDIS: a foundation of time-lock puzzles in UC	2021-12-08	Paper
Insured MPC: efficient secure computation with financial penalties	2021-02-08	Paper
Efficient UC commitment extension with homomorphism for free (and applications)	2020-05-05	Paper
21 -- bringing down the complexity: fast composable protocols for card games without secret state	2018-09-26	Paper
Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain	2018-07-09	Paper
Ouroboros: a provably secure proof-of-stake blockchain protocol	2017-11-03	Paper
Rate-1, Linear Time and Additively Homomorphic UC Commitments	2016-11-09	Paper
Constant-size structure-preserving signatures: generic constructions and simple assumptions	2016-10-13	Paper
Efficient Unconditionally Secure Comparison and Privacy Preserving Machine Learning Classification Protocols	2016-01-27	Paper
Generalizing Efficient Multiparty Computation	2015-09-24	Paper
Additively Homomorphic UC Commitments with Optimal Amortized Overhead	2015-08-27	Paper
Universally Composable Oblivious Transfer Based on a Variant of LPN	2015-02-10	Paper
Compact VSS and Efficient Homomorphic UC Commitments	2015-01-06	Paper
Tagged One-Time Signatures: Tight Security and Optimal Tag Size	2013-04-19	Paper
Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions	2013-03-19	Paper
Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions	2012-11-06	Paper
Universally Composable Private Proximity Testing	2011-09-16	Paper

Research outcomes over time

This page was built for person: Bernardo David