Ferucio Laurentiu Tiplea
Orcid: 0000-0001-6143-3641Affiliations:
- Alexandru Ioan Cuza University, Iași, Romania
According to our database1,
Ferucio Laurentiu Tiplea
authored at least 79 papers
between 1991 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
The Jacobi Symbol Problem for Quadratic Congruences and Applications to Cryptography.
IACR Cryptol. ePrint Arch., 2023
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 27th International Conference KES-2023, 2023
2022
IEEE Trans. Dependable Secur. Comput., 2022
Int. J. Inf. Sec., 2022
IACR Cryptol. ePrint Arch., 2022
Privacy and Reader-first Authentication in Vaudenay's RFID Model with Temporary State Disclosure.
Comput. Sci. J. Moldova, 2022
Proceedings of the IEEE International Symposium on Information Theory, 2022
2021
PUF Protected Variables: A Solution to RFID Security and Privacy Under Corruption With Temporary State Disclosure.
IEEE Trans. Inf. Forensics Secur., 2021
Asymptotically ideal Chinese remainder theorem -based secret sharing schemes for multilevel and compartmented access structures.
IET Inf. Secur., 2021
Proceedings of the 18th International Conference on Security and Cryptography, 2021
2020
IEEE Trans. Inf. Forensics Secur., 2020
On the distribution of quadratic residues and non-residues modulo composite integers and applications to cryptography.
Appl. Math. Comput., 2020
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020
Practically Efficient Attribute-Based Encryption for Compartmented and Multilevel Access Structures.
Proceedings of the E-Business and Telecommunications, 2020
Practically Efficient Attribute-based Encryption for Compartmented Access Structures.
Proceedings of the 17th International Joint Conference on e-Business and Telecommunications, 2020
2019
Privacy and Reader-first Authentication in Vaudenay's RFID Model with Temporary State Disclosure.
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
Comput. Sci. J. Moldova, 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 Innovative Security Solutions for Information Technology and Communications, 2018
Proceedings of the 2018 Federated Conference on Computer Science and Information Systems, 2018
2017
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2017
2016
The Reversible Released Form of Petri Nets and Its Applications to Soundness of Workflow Nets.
IEEE Trans. Syst. Man Cybern. Syst., 2016
IACR Cryptol. ePrint Arch., 2016
2015
IEEE Trans. Syst. Man Cybern. Syst., 2015
IACR Cryptol. ePrint Arch., 2015
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 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
Resource Relocation in Workflow Nets With Time, Resource, and Task Priority Constraints.
IEEE Trans. Syst. Man Cybern. Syst., 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
Proceedings of the Cryptography and Security Systems - Third International Conference, 2014
2013
Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes.
Inf. Sci., 2013
Future Gener. Comput. Syst., 2013
2012
IEEE Trans. Syst. Man Cybern. Part A, 2012
2011
Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable
CoRR, 2011
2010
Proceedings of the Computer Security, 2010
2009
IEEE Trans. Syst. Man Cybern. Part A, 2009
Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009
An Automaton-based Formalism for Cooperative Augmented Reality Systems.
Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009
2008
J. Comput. Secur., 2008
2006
Proceedings of the First Workshop in Information and Computer Security, 2006
Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), 2006
Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), 2006
2005
Decidability and Complexity Results for Security Protocols.
Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005
2002
J. Autom. Lang. Comb., 2002
Proceedings of the Verification, 2002
2001
2000
Acta Cybern., 2000
1999
Proceedings of the 6. Workshop Algorithmen und Werkzeuge für Petrinetze (AWPN'99), Frankfurt, Germany, October 11., 1999
1998
On Normalization of Petri Nets.
Sci. Ann. Cuza Univ., 1998
1997
J. Autom. Lang. Comb., 1997
J. Autom. Lang. Comb., 1997
1996
1995
(0, 1)-Total Pure Context-Free Grammars.
Proceedings of the Developments in Language Theory II, 1995
1994
Theor. Comput. Sci., 1994
Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994
1993
A Coverability Structure for Parallel Communicating Grammar Systems.
J. Inf. Process. Cybern., 1993
Relation Based Controlled Petri Nets.
Sci. Ann. Cuza Univ., 1993
1992
Corrections to "Reversible and Strict Reversible P/T-Systems".
Sci. Ann. Cuza Univ., 1992
1991
Conditional Petri Net Languages.
J. Inf. Process. Cybern., 1991