Ferucio Laurentiu Tiplea

Orcid: 0000-0001-6143-3641

Affiliations:
  • Alexandru Ioan Cuza University, Iași, Romania


According to our database1, Ferucio Laurentiu Tiplea authored at least 82 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Low Weight Polynomial Multiple Problem.
CoRR, 2024

On Privacy of RFID-Based Authentication Protocols.
Proceedings of the 21st International Conference on Security and Cryptography, 2024

On Privacy of PRF+PUF-based Authentication.
Proceedings of the 19th Conference on Computer Science and Intelligence Systems, 2024

2023
The Jacobi Symbol Problem for Quadratic Congruences and Applications to Cryptography.
IACR Cryptol. ePrint Arch., 2023

Efficient RFID Scheme in Healthcare Systems.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 27th International Conference KES-2023, 2023

2022
Lessons to be Learned for a Good Design of Private RFID Schemes.
IEEE Trans. Dependable Secur. Comput., 2022

Narrow privacy and desynchronization in Vaudenay's RFID model.
Int. J. Inf. Sec., 2022

Security of Identity-based Encryption Schemes from Quadratic Residues.
IACR Cryptol. ePrint Arch., 2022

Privacy and Reader-first Authentication in Vaudenay's RFID Model with Temporary State Disclosure.
Comput. Sci. J. Moldova, 2022

Generalized Inverse Based Decoding.
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

Practically Efficient RFID Scheme with Constant-time Identification.
Proceedings of the 18th International Conference on Security and Cryptography, 2021

2020
Privacy of Stateful RFID Systems With Constant Tag Identifiers.
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

A Hennessy-Milner Theorem for ATL with Imperfect Information.
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

Destructive Privacy and Mutual Authentication in Vaudenay's RFID Model.
IACR Cryptol. ePrint Arch., 2019

On Anonymization of Cocks' Identity-based Encryption Scheme.
Comput. Sci. J. Moldova, 2019

2018
On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme.
Inf. Sci., 2018

Asymptotically Ideal CRT-based Secret Sharing Schemes for Multilevel and Compartmented Access Structures.
IACR Cryptol. ePrint Arch., 2018

A PUF-Based Destructive Private Mutual Authentication RFID Protocol.
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2018

Group Anonymity in Security Protocols.
Proceedings of the 2018 Federated Conference on Computer Science and Information Systems, 2018

2017
Key-Policy Attribute-Based Encryption from Bilinear Maps.
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

Distributive weighted threshold secret sharing schemes.
Inf. Sci., 2016

Boneh-Gentry-Hamburg's Identity-based Encryption Schemes Revisited.
IACR Cryptol. ePrint Arch., 2016

2015
Petri Net Computers and Workflow Nets.
IEEE Trans. Syst. Man Cybern. Syst., 2015

On the Complexity of Deciding Soundness of Acyclic Workflow Nets.
IEEE Trans. Syst. Man Cybern. Syst., 2015

New Results on Identity-based Encryption from Quadratic Residuosity.
IACR Cryptol. ePrint Arch., 2015

On a Lightweight Authentication Protocol for RFID.
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

Key-policy Attribute-based Encryption for Boolean Circuits from Bilinear Maps.
IACR Cryptol. ePrint Arch., 2014

Efficient Key-policy Attribute-based Encryption for General Boolean Circuits from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2014

A Lightweight Authentication Protocol for RFID.
Proceedings of the Cryptography and Security Systems - Third International Conference, 2014

2013
Priority Workflow Nets.
IEEE Trans. Syst. Man Cybern. Syst., 2013

Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes.
Inf. Sci., 2013

Reasoning about minimal anonymity in security protocols.
Future Gener. Comput. Syst., 2013

2012
Decidability Results for Soundness Criteria of Resource-Constrained Workflow Nets.
IEEE Trans. Syst. Man Cybern. Part A, 2012

2011
Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable
CoRR, 2011

2010
Complexity of Anonymity for Security Protocols.
Proceedings of the Computer Security, 2010

2009
Soundness for S - and A -Timed Workflow Nets Is Undecidable.
IEEE Trans. Syst. Man Cybern. Part A, 2009

Classes of Szilard Languages in NC<sup>1</sup>.
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
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete.
J. Comput. Secur., 2008

2006
Petri net reactive modules.
Theor. Comput. Sci., 2006

Preface.
Proceedings of the First Workshop in Information and Computer Security, 2006

Abstractions of data types.
Acta Informatica, 2006

E-timed Workflow Nets.
Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), 2006

The Confluence Property for Petri Nets and its Applications.
Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), 2006

2005
Structural soundness of workflow nets is decidable.
Inf. Process. Lett., 2005

Decidability and Complexity Results for Security Protocols.
Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005

Instantiating Nets and Their Applications to Workflow Nets.
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005

Timed Workflow Nets.
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005

2002
On the Complexity of a Problem on Monadic String Rewriting Systems.
J. Autom. Lang. Comb., 2002

SE-Systems, Timing Mechanisms, and Time-Varying Codes.
Int. J. Comput. Math., 2002

Characterization Results for Time-Varying Codes.
Fundam. Informaticae, 2002

The Home Marking Problem and Some Related Concepts.
Acta Cybern., 2002

A Simulation Preorder for Abstraction of Reactive Systems.
Proceedings of the Verification, 2002

2001
A note on synchronized extension systems.
Inf. Process. Lett., 2001

A Note on SE-Systems and Regular Canonical Systems.
Fundam. Informaticae, 2001

Synchronized extension systems.
Acta Informatica, 2001

2000
A Note on Decidability of Reachability for Conditional Petri Nets.
Acta Cybern., 2000

1999
Petri Net Process Decomposition with Application to Validation.
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
Processes and Vectorial Characterizations of Parallel Communicating Grammar Systems.
J. Autom. Lang. Comb., 1997

Hierarchies of Petri Net Languages and a Super-Normal Form.
J. Autom. Lang. Comb., 1997

Jumping Petri Nets. Specific Properties.
Fundam. Informaticae, 1997

Pattern Ambiguities for Pure Context-Free Grammars.
Fundam. Informaticae, 1997

1996
On a Normal Form of Petri Nets.
Acta Cybern., 1996

1995
(0, 1)-Total Pure Context-Free Grammars.
Proceedings of the Developments in Language Theory II, 1995

1994
Some Decision Problems for Parallel Communicating Grammar Systems.
Theor. Comput. Sci., 1994

On Conditional Grammars and Conditional Petri Nets.
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
Selective petri net languages.
Int. J. Comput. Math., 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


  Loading...