Model-checking ATL under imperfect information and perfect recall semantics is undecidable C Dima, FL Tiplea arXiv preprint arXiv:1102.4225, 2011 | 123 | 2011 |
Decidability and complexity results for security protocols FL Tiplea, C Enea, CV Bîrjoveanu VISSAS 1, 185-211, 2005 | 43 | 2005 |
Structural soundness of workflow nets is decidable FL Ţiplea, DC Marinescu Information Processing Letters 96 (2), 54-58, 2005 | 42 | 2005 |
Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes M Barzu, FL Ţiplea, CC Drăgan Information Sciences 240, 161-172, 2013 | 25 | 2013 |
Key-policy attribute-based encryption for boolean circuits from bilinear maps FL Ţiplea, CC Drăgan Cryptography and Information Security in the Balkans: First International …, 2015 | 23 | 2015 |
E-timed workflow nets FL Tiplea, GI Macovei 2006 Eighth International Symposium on Symbolic and Numeric Algorithms for …, 2006 | 23 | 2006 |
Timed workflow nets GIM FL Tiplea SYNASC 2005, 361-366, 2005 | 23* | 2005 |
Distributive weighted threshold secret sharing schemes CC Drăgan, FL Ţiplea Information sciences 339, 85-97, 2016 | 22 | 2016 |
Decidability results for soundness criteria of resource-constrained workflow nets FL Tiplea, C Bocaneala IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and …, 2012 | 21 | 2012 |
Jumping petri nets FL Tiplea, T Jucan Foundations of Computing and Decision Sciences 19 (4), 319-332, 1994 | 20 | 1994 |
On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme CC Drăgan, FL Tiplea Information Sciences 463, 75-85, 2018 | 19 | 2018 |
On the distribution of quadratic residues and non-residues modulo composite integers and applications to cryptography FL Ţiplea, S Iftene, G Teşeleanu, AM Nica Applied Mathematics and Computation 372, 124993, 2020 | 18 | 2020 |
Some decision problems for parallel communicating grammar systems FL Tiplea, C Ene, CM Ionescu, O Procopiuc Theoretical Computer Science 134 (2), 365-385, 1994 | 18 | 1994 |
Key-policy attribute-based encryption for general boolean circuits from secret sharing and multi-linear maps CC Drăgan, FL Ţiplea Cryptography and Information Security in the Balkans: Second International …, 2016 | 16 | 2016 |
On the complexity of deciding soundness of acyclic workflow nets FL Ţiplea, C Bocăneală, R Chiroşcă IEEE Transactions on Systems, Man, and Cybernetics: Systems 45 (9), 1292-1298, 2015 | 15 | 2015 |
Soundness for - and -Timed Workflow Nets Is Undecidable FL Tiplea, GI Macovei IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and …, 2009 | 15 | 2009 |
Destructive privacy and mutual authentication in Vaudenay’s RFID model C Hristea, FL Ţiplea International Workshop Soft Computing Applications, 648-676, 2020 | 14 | 2020 |
Model-checking ATL under imperfect information and perfect recall semantics is undecidable. CoRR abs/1102.4225 (2011) C Dima, FL Tiplea arXiv preprint arXiv:1102.4225, 2011 | 14 | 2011 |
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete FL Ţiplea, CV Bîrjoveanu, C Enea, I Boureanu Journal of Computer Security 16 (6), 689-712, 2008 | 14 | 2008 |
PUF protected variables: A solution to RFID security and privacy under corruption with temporary state disclosure FL Ţiplea, C Hristea IEEE Transactions on Information Forensics and Security 16, 999-1013, 2020 | 13 | 2020 |