Bernardo David
Bernardo David
Associate Professor, IT University of Copenhagen
Bestätigte E-Mail-Adresse bei itu.dk - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Ouroboros: A provably secure proof-of-stake blockchain protocol
A Kiayias, A Russell, B David, R Oliynykov
Annual International Cryptology Conference, 357-388, 2017
11562017
Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain
B David, P Gaži, A Kiayias, A Russell
Annual International Conference on the Theory and Applications of …, 2018
348*2018
Constant-size structure-preserving signatures: Generic constructions and simple assumptions
M Abe, M Chase, B David, M Kohlweiss, R Nishimaki, M Ohkubo
International Conference on the Theory and Application of Cryptology and …, 2012
112*2012
Tagged one-time signatures: Tight security and optimal tag size
M Abe, B David, M Kohlweiss, R Nishimaki, M Ohkubo
International Workshop on Public Key Cryptography, 312-331, 2013
822013
SCRAPE: Scalable randomness attested by public entities
I Cascudo, B David
International Conference on Applied Cryptography and Network Security, 537-556, 2017
732017
A Formal Classification of Internet Banking Attacks and Vulnerabilities
L Peotta, MD Holtz, BM David, FG Deus, RT de Sousa
International Journal of Computer Science & Information Technology 3 (1 …, 2011
622011
Rate-1, linear time and additively homomorphic UC commitments
I Cascudo, I Damgård, B David, N Döttling, JB Nielsen
Annual Cryptology Conference, 179-207, 2016
372016
Compact VSS and efficient homomorphic UC commitments
I Damgård, B David, I Giacomelli, JB Nielsen
International Conference on the Theory and Application of Cryptology and …, 2014
312014
Building scalable distributed intrusion detection systems based on the mapreduce framework
MD Holtz, B David, RT de Sousa Júnior
Revista Telecommun 13 (2), 22, 2011
302011
Efficient unconditionally secure comparison and privacy preserving machine learning classification protocols
B David, R Dowsley, R Katti, ACA Nascimento
International Conference on Provable Security, 354-367, 2015
292015
Additively Homomorphic UC commitments with Optimal Amortized Overhead
IC Pueyo, IB Damgård, BM David, I Giacomelli, JB Nielsen, R Trifiletti
International Conference on Practice and Theory in Public-Key Cryptography, 2015
292015
Universally composable oblivious transfer based on a variant of LPN
B David, R Dowsley, ACA Nascimento
International Conference on Cryptology and Network Security, 143-158, 2014
292014
A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM
PSLM Barreto, B David, R Dowsley, K Morozov, ACA Nascimento
27*
Unconditionally secure, universally composable privacy preserving linear algebra
B David, R Dowsley, J van de Graaf, D Marques, ACA Nascimento, ...
IEEE Transactions on Information Forensics and Security 11 (1), 59-73, 2015
202015
Insured mpc: Efficient secure computation with financial penalties
C Baum, B David, R Dowsley
International Conference on Financial Cryptography and Data Security, 404-420, 2020
16*2020
Kaleidoscope: An efficient poker protocol with payment distribution and penalty enforcement
B David, R Dowsley, M Larangeira
International Conference on Financial Cryptography and Data Security, 500-519, 2018
132018
Blind automatic malicious activity detection in honeypot data
BM David, J da Costa, ACA Nascimento, D Amaral, MD Holtz, ...
The International Conference on Forensic Computer Science (ICoFCS), 2011
132011
ALBATROSS: Publicly AttestabLe BATched Randomness Based On Secret Sharing
I Cascudo, B David
International Conference on the Theory and Application of Cryptology and …, 2020
122020
TARDIS: Time And Relative Delays In Simulation.
C Baum, B David, R Dowsley, JB Nielsen, S Oechsner
IACR Cryptol. ePrint Arch. 2020, 537, 2020
12*2020
Universally composable oblivious transfer from lossy encryption and the mceliece assumptions
BM David, ACA Nascimento, J Müller-Quade
International Conference on Information Theoretic Security, 80-99, 2012
122012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20