Constantin Catalin Dragan
Orcid: 0000-0002-4033-9880Affiliations:
- University of Surrey, Guildford, UK
According to our database1,
Constantin Catalin Dragan
authored at least 27 papers
between 2009 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Towards End-to-End Verifiable Online Voting: Adding Verifiability to Established Voting Systems.
IEEE Trans. Dependable Secur. Comput., 2024
2023
J. Comput. Secur., 2023
Proceedings of the Computer Security - ESORICS 2023, 2023
2022
IEEE Trans. Serv. Comput., 2022
2021
Asymptotically ideal Chinese remainder theorem -based secret sharing schemes for multilevel and compartmented access structures.
IET Inf. Secur., 2021
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021
2020
Precise and Mechanised Models and Proofs for Distance-Bounding and an Application to Contactless Payments.
IACR Cryptol. ePrint Arch., 2020
Proceedings of the SAC '20: The 35th ACM/SIGAPP Symposium on Applied Computing, online event, [Brno, Czech Republic], March 30, 2020
Augmenting an Internet Voting System with Selene Verifiability using Permissioned Distributed Ledger.
Proceedings of the 40th IEEE International Conference on Distributed Computing Systems, 2020
2019
Proceedings of the IEEE European Symposium on Security and Privacy, 2019
2018
Inf. Sci., 2018
Asymptotically Ideal CRT-based Secret Sharing Schemes for Multilevel and Compartmented Access Structures.
IACR Cryptol. ePrint Arch., 2018
Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2018
Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios.
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018
2017
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2017
2016
2015
Key-Policy Attribute-Based Encryption for General Boolean Circuits from Secret Sharing and Multi-linear Maps.
Proceedings of the Cryptography and Information Security in the Balkans, 2015
2014
A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme.
Inf. Process. Lett., 2014
IACR Cryptol. ePrint Arch., 2014
Efficient Key-policy Attribute-based Encryption for General Boolean Circuits from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2014
2013
Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes.
Inf. Sci., 2013
2009
Interactive Secret Share Management.
Proceedings of the SECRYPT 2009, 2009