Obserwuj
Manuel Barbosa
Manuel Barbosa
Universidade do Porto (FCUP) and INESC TEC
Zweryfikowany adres z fc.up.pt - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
An overview of controller area network
M Farsi, K Ratcliff, M Barbosa
Computing and Control Engineering 10 (3), 113-120, 1999
4061999
Certificateless signcryption
M Barbosa, P Farshim
Proceedings of the 2008 ACM symposium on Information, computer and …, 2008
3972008
Verifying {Constant-Time} Implementations
JB Almeida, M Barbosa, G Barthe, F Dupressoir, M Emmi
25th USENIX Security Symposium (USENIX Security 16), 53-70, 2016
3462016
SoK: Computer-aided cryptography
M Barbosa, G Barthe, K Bhargavan, B Blanchet, C Cremers, K Liao, ...
2021 IEEE symposium on security and privacy (SP), 777-795, 2021
2032021
Jasmin: High-assurance and high-speed cryptography
JB Almeida, M Barbosa, G Barthe, A Blot, B Grégoire, V Laporte, ...
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
1902017
ADSNARK: Nearly practical and privacy-preserving proofs on authenticated data
M Backes, M Barbosa, D Fiore, RM Reischuk
2015 IEEE Symposium on Security and Privacy, 271-286, 2015
1422015
CANopen implementation: applications to industrial networks
M Farsi, MBM Barbosa
Research Studies Press, 2000
1252000
Secure multiparty computation from SGX
R Bahmani, M Barbosa, F Brasser, B Portela, AR Sadeghi, G Scerri, ...
International Conference on Financial Cryptography and Data Security, 477-497, 2017
1212017
The last mile: High-assurance and high-speed cryptographic implementations
JB Almeida, M Barbosa, G Barthe, B Grégoire, A Koutsos, V Laporte, ...
2020 IEEE Symposium on Security and Privacy (SP), 965-982, 2020
952020
Delegatable homomorphic encryption with applications to secure outsourcing of computation
M Barbosa, P Farshim
Topics in Cryptology–CT-RSA 2012: The Cryptographers’ Track at the RSA …, 2012
912012
Foundations of hardware-based attested computation and application to SGX
M Barbosa, B Portela, G Scerri, B Warinschi
2016 IEEE European Symposium on Security and Privacy (EuroS&P), 245-260, 2016
872016
Verifiable side-channel security of cryptographic implementations: constant-time MEE-CBC
JB Almeida, M Barbosa, G Barthe, F Dupressoir
Fast Software Encryption: 23rd International Conference, FSE 2016, Bochum …, 2016
832016
Formal verification of side-channel countermeasures using self-composition
JB Almeida, M Barbosa, JS Pinto, B Vieira
Science of Computer Programming 78 (7), 796-812, 2013
792013
A certifying compiler for zero-knowledge proofs of knowledge based on σ-protocols
JB Almeida, E Bangerter, M Barbosa, S Krenn, AR Sadeghi, T Schneider
Computer Security–ESORICS 2010: 15th European Symposium on Research in …, 2010
672010
Certified computer-aided cryptography: efficient provably secure machine code from high-level implementations
JB Almeida, M Barbosa, G Barthe, F Dupressoir
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications …, 2013
642013
Efficient identity-based key encapsulation to multiple parties
M Barbosa, P Farshim
Cryptography and Coding: 10th IMA International Conference, Cirencester, UK …, 2005
632005
Machine-checked proofs for cryptographic standards: Indifferentiability of sponge and secure high-assurance implementations of SHA-3
JB Almeida, C Baritel-Ruet, M Barbosa, G Barthe, F Dupressoir, ...
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019
572019
Secure biometric authentication with improved accuracy
M Barbosa, T Brouard, S Cauchie, SM De Sousa
Information Security and Privacy: 13th Australasian Conference, ACISP 2008 …, 2008
562008
Full proof cryptography: verifiable compilation of efficient zero-knowledge protocols
J Bacelar Almeida, M Barbosa, E Bangerter, G Barthe, S Krenn, ...
Proceedings of the 2012 ACM conference on Computer and communications …, 2012
552012
Provable security analysis of FIDO2
M Barbosa, A Boldyreva, S Chen, B Warinschi
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
532021
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20