default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDConstantin Catalin Dragan
Person information
- affiliation: University of Surrey, Guildford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Mohammed Alsadi
, Matthew Casey, Constantin Catalin Dragan, François Dupressoir, Luke Riley, Muntadher Sallal, Steve Schneider, Helen Treharne, Joe Wadsworth, Phil Wright:
Towards End-to-End Verifiable Online Voting: Adding Verifiability to Established Voting Systems. IEEE Trans. Dependable Secur. Comput. 21(4): 3357-3374 (2024)- 2023
- [j7]Constantin Catalin Dragan, François Dupressoir, Ehsan Estaji, Kristian Gjøsteen, Thomas Haines, Peter Y. A. Ryan, Peter B. Rønne, Morten Rotvold Solberg:
Machine-checked proofs of privacy against malicious boards for Selene & Co. J. Comput. Secur. 31(5): 469-499 (2023) - [c15]Constantin Catalin Dragan, François Dupressoir, Kristian Gjøsteen, Thomas Haines, Peter B. Rønne, Morten Rotvold Solberg:
Machine-Checked Proofs of Accountability: How to sElect Who is to Blame. ESORICS (3) 2023: 471-491 - 2022
- [j6]Yifan Yang, Daniel Cooper, John P. Collomosse, Constantin Catalin Dragan, Mark Manulis, Jamie Steane, Arthi Manohar, Jo Briggs, Helen S. Jones, Wendy Moncur:
TAPESTRY: A De-Centralized Service for Trusted Interaction Online. IEEE Trans. Serv. Comput. 15(3): 1385-1398 (2022) - [c14]Constantin Catalin Dragan, François Dupressoir, Ehsan Estaji, Kristian Gjøsteen, Thomas Haines, Peter Y. A. Ryan, Peter B. Rønne, Morten Rotvold Solberg:
Machine-Checked Proofs of Privacy Against Malicious Boards for Selene & Co. CSF 2022: 335-347 - [i11]Constantin Catalin Dragan, François Dupressoir, Ehsan Estaji, Kristian Gjøsteen, Thomas Haines, Peter Y. A. Ryan, Peter B. Rønne, Morten Rotvold Solberg:
Machine-Checked Proofs of Privacy Against Malicious Boards for Selene & Co. IACR Cryptol. ePrint Arch. 2022: 1182 (2022) - 2021
- [j5]Ferucio Laurentiu Tiplea, Constantin Catalin Dragan:
Asymptotically ideal Chinese remainder theorem -based secret sharing schemes for multilevel and compartmented access structures. IET Inf. Secur. 15(4): 282-296 (2021) - [c13]Ioana Boureanu, Constantin Catalin Dragan, François Dupressoir, David Gérault, Pascal Lafourcade:
Mechanised Models and Proofs for Distance-Bounding. CSF 2021: 1-16 - 2020
- [c12]Daniel Gardham, Mark Manulis, Constantin Catalin Dragan:
Biometric-Authenticated Searchable Encryption. ACNS (2) 2020: 40-61 - [c11]Muntadher Sallal, Steve Schneider, Matthew Casey, François Dupressoir, Helen Treharne, Constantin Catalin Dragan, Luke Riley, Phil Wright:
Augmenting an Internet Voting System with Selene Verifiability using Permissioned Distributed Ledger. ICDCS 2020: 1167-1168 - [c10]Constantin Catalin Dragan, Mark Manulis:
KYChain: user-controlled KYC data sharing and certification. SAC 2020: 301-307 - [e1]Ioana Boureanu, Constantin Catalin Dragan, Mark Manulis, Thanassis Giannetsos, Christoforos Dadoyan, Panagiotis Gouvas, Roger A. Hallman, Shujun Li, Victor Chang, Frank Pallas, Jörg Pohle, M. Angela Sasse:
Computer Security - ESORICS 2020 International Workshops, DETIPS, DeSECSys, MPS, and SPOSE, Guildford, UK, September 17-18, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12580, Springer 2020, ISBN 978-3-030-66503-6 [contents] - [i10]Constantin Catalin Dragan, Mark Manulis:
KYChain: User-Controlled KYC Data Sharing and Certification. CoRR abs/2001.01659 (2020) - [i9]Daniel Gardham, Mark Manulis, Constantin Catalin Dragan:
Biometric-Authenticated Searchable Encryption. IACR Cryptol. ePrint Arch. 2020: 17 (2020) - [i8]Ioana Boureanu, Constantin Catalin Dragan, François Dupressoir, David Gérault, Pascal Lafourcade:
Precise and Mechanised Models and Proofs for Distance-Bounding and an Application to Contactless Payments. IACR Cryptol. ePrint Arch. 2020: 1000 (2020)
2010 – 2019
- 2019
- [c9]Sergiu Bursuc, Constantin Catalin Dragan, Steve Kremer:
Private Votes on Untrusted Platforms: Models, Attacks and Provable Scheme. EuroS&P 2019: 606-620 - [i7]Yifan Yang, Daniel Cooper, John P. Collomosse, Constantin Catalin Dragan, Mark Manulis, Jamie Steane, Arthi Manohar, Jo Briggs, Helen S. Jones, Wendy Moncur:
TAPESTRY: A Blockchain based Service for Trusted Interaction Online. CoRR abs/1905.06186 (2019) - [i6]Muntadher Sallal, Steve A. Schneider, Matthew Casey, Constantin Catalin Dragan, François Dupressoir, Luke Riley, Helen Treharne, Joe Wadsworth, Phil Wright:
VMV: Augmenting an Internet Voting System with Selene Verifiability. CoRR abs/1912.00288 (2019) - 2018
- [j4]Constantin Catalin Dragan, Ferucio Laurentiu Tiplea:
On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme. Inf. Sci. 463-464: 75-85 (2018) - [c8]Constantin Catalin Dragan, Daniel Gardham, Mark Manulis:
Hierarchical Attribute-Based Signatures. CANS 2018: 213-234 - [c7]Véronique Cortier, Constantin Catalin Dragan, François Dupressoir, Bogdan Warinschi:
Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios. CSF 2018: 298-312 - [c6]Constantin Catalin Dragan, Mark Manulis:
Bootstrapping Online Trust: Timeline Activity Proofs. DPM/CBT@ESORICS 2018: 242-259 - [i5]Constantin Catalin Dragan, Daniel Gardham, Mark Manulis:
Hierarchical Attribute-based Signatures. IACR Cryptol. ePrint Arch. 2018: 610 (2018) - [i4]Ferucio Laurentiu Tiplea, Constantin Catalin Dragan:
Asymptotically Ideal CRT-based Secret Sharing Schemes for Multilevel and Compartmented Access Structures. IACR Cryptol. ePrint Arch. 2018: 933 (2018) - 2017
- [c5]Ferucio Laurentiu Tiplea, Constantin Catalin Dragan, Anca-Maria Nica:
Key-Policy Attribute-Based Encryption from Bilinear Maps. SECITC 2017: 28-42 - [c4]Véronique Cortier, Constantin Catalin Dragan, François Dupressoir, Benedikt Schmidt, Pierre-Yves Strub, Bogdan Warinschi:
Machine-Checked Proofs of Privacy for Electronic Voting Protocols. IEEE Symposium on Security and Privacy 2017: 993-1008 - 2016
- [j3]Constantin Catalin Dragan, Ferucio Laurentiu Tiplea:
Distributive weighted threshold secret sharing schemes. Inf. Sci. 339: 85-97 (2016) - 2015
- [c3]Constantin Catalin Dragan, Ferucio Laurentiu Tiplea:
Key-Policy Attribute-Based Encryption for General Boolean Circuits from Secret Sharing and Multi-linear Maps. BalkanCryptSec 2015: 112-133 - 2014
- [j2]Ferucio Laurentiu Tiplea, Constantin Catalin Dragan:
A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme. Inf. Process. Lett. 114(6): 299-303 (2014) - [c2]Ferucio Laurentiu Tiplea, Constantin Catalin Dragan:
Key-Policy Attribute-Based Encryption for Boolean Circuits from Bilinear Maps. BalkanCryptSec 2014: 175-193 - [i3]Constantin Catalin Dragan, Ferucio Laurentiu Tiplea:
Efficient Key-policy Attribute-based Encryption for General Boolean Circuits from Multilinear Maps. IACR Cryptol. ePrint Arch. 2014: 462 (2014) - [i2]Ferucio Laurentiu Tiplea, Constantin Catalin Dragan:
Key-policy Attribute-based Encryption for Boolean Circuits from Bilinear Maps. IACR Cryptol. ePrint Arch. 2014: 608 (2014) - [i1]Constantin Catalin Dragan, Ferucio Laurentiu Tiplea:
On the Asymptotic Idealness of the Asmuth-Bloom Threshold Secret Sharing Scheme. IACR Cryptol. ePrint Arch. 2014: 955 (2014) - 2013
- [j1]Mihai Barzu, Ferucio Laurentiu Tiplea, Constantin Catalin Dragan:
Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes. Inf. Sci. 240: 161-172 (2013)
2000 – 2009
- 2009
- [c1]Constantin Catalin Dragan:
Interactive Secret Share Management. SECRYPT 2009: 266-269
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-05 22:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
