Search

Your search keyword '"Ţiplea, Ferucio Laurenţiu"' showing total 47 results
Start Over Author "Ţiplea, Ferucio Laurenţiu"
47 results on '"Ţiplea, Ferucio Laurenţiu"'

1. On the Low Weight Polynomial Multiple Problem

Author

Ţiplea, Ferucio Laurenţiu and Lăzărescu, Simona-Maria

Subjects
Computer Science - Computational Complexity, 68Q15, 68Q25, 14G50, 94A60
Abstract

Finding a low-weight multiple (LWPM) of a given polynomial is very useful in the cryptanalysis of stream ciphers and arithmetic in finite fields. There is no known deterministic polynomial time complexity algorithm for solving this problem, and the most efficient algorithms are based on a time/memory trade-off. The widespread perception is that this problem is difficult. In this paper, we establish a relationship between the LWPM problem and the MAX-SAT problem of determining an assignment that maximizes the number of valid clauses of a system of affine Boolean clauses. This relationship shows that any algorithm that can compute the optimum of a MAX-SAT instance can also compute the optimum of an equivalent LWPM instance. It also confirms the perception that the LWPM problem is difficult., Comment: 13 pages, 4 figures

Published
2024

2. Generalized Inverse Based Decoding

Author

Tiplea, Ferucio Laurentiu and Dragoi, Vlad-Florin

Subjects
Computer Science - Information Theory, Computer Science - Cryptography and Security, 11T71, 68P30, 94Bxx, 94A60, E.4, F.2, H.1.1
Abstract

The concept of Generalized Inverse based Decoding (GID) is introduced, as an algebraic framework for the syndrome decoding problem (SDP) and low weight codeword problem (LWP). The framework has ground on two characterizations by generalized inverses (GIs), one for the null space of a matrix and the other for the solution space of a system of linear equations over a finite field. Generic GID solvers are proposed for SDP and LWP. It is shown that information set decoding (ISD) algorithms, such as Prange, Lee-Brickell, Leon, and Stern's algorithms, are particular cases of GID solvers. All of them search GIs or elements of the null space under various specific strategies. However, as the paper shows the ISD variants do not search through the entire space, while our solvers do even when they use just one Gaussian elimination. Apart from these, our GID framework clearly shows how each ISD algorithm, except for Prange's solution, can be used as an SDP or LWP solver. A tight reduction from our problems, viewed as optimization problems, to the MIN-SAT problem is also provided. Experimental results show a very good behavior of the GID solvers. The domain of easy weights can be reached by a very few iterations and even enlarged., Comment: 41 pages, 5 figures, 5 page abstract submitted to ISIT2022

Published
2022

3. Destructive Privacy and Mutual Authentication in Vaudenay’s RFID Model

Author

Hristea, Cristian, Ţiplea, Ferucio Laurenţiu, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Balas, Valentina Emilia, editor, Jain, Lakhmi C., editor, Balas, Marius Mircea, editor, and Baleanu, Dumitru, editor

Published
2023
Full Text
View/download PDF

6. A PUF-Based Destructive Private Mutual Authentication RFID Protocol

Author

Hristea, Cristian, Ţiplea, Ferucio Laurenţiu, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Lanet, Jean-Louis, editor, and Toma, Cristian, editor

Published
2019
Full Text
View/download PDF

8. Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

Author

Dima, Catalin and Tiplea, Ferucio Laurentiu

Subjects
Computer Science - Logic in Computer Science, Computer Science - Multiagent Systems, 03B44, 03B42, 68Q60, F.4.1, D.2.4
Abstract

We propose a formal proof of the undecidability of the model checking problem for alternating- time temporal logic under imperfect information and perfect recall semantics. This problem was announced to be undecidable according to a personal communication on multi-player games with imperfect information, but no formal proof was ever published. Our proof is based on a direct reduction from the non-halting problem for Turing machines.

Published
2011

9. Key-Policy Attribute-Based Encryption from Bilinear Maps

Author

Ţiplea, Ferucio Laurenţiu, Drăgan, Constantin Cătălin, Nica, Anca-Maria, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Farshim, Pooya, editor, and Simion, Emil, editor

Published
2017
Full Text
View/download PDF

11. Key-Policy Attribute-Based Encryption for General Boolean Circuits from Secret Sharing and Multi-linear Maps

Author

Drăgan, Constantin Cătălin, Ţiplea, Ferucio Laurenţiu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Pasalic, Enes, editor, and Knudsen, Lars R., editor

Published
2016
Full Text
View/download PDF

12. Security of Identity-Based Encryption Schemes from Quadratic Residues

Author

Ţiplea, Ferucio Laurenţiu, Iftene, Sorin, Teşeleanu, George, Nica, Anca-Maria, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bica, Ion, editor, and Reyhanitabar, Reza, editor

Published
2016
Full Text
View/download PDF

14. On a Lightweight Authentication Protocol for RFID

Author

Năstase, George-Daniel, Ţiplea, Ferucio Laurenţiu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bica, Ion, editor, Naccache, David, editor, and Simion, Emil, editor

Published
2015
Full Text
View/download PDF

15. Key-Policy Attribute-Based Encryption for Boolean Circuits from Bilinear Maps

Author

Ţiplea, Ferucio Laurenţiu, Drăgan, Constantin Cătălin, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Ors, Berna, editor, and Preneel, Bart, editor

Published
2015
Full Text
View/download PDF

17. A Lightweight Authentication Protocol for RFID

Author

Ţiplea, Ferucio Laurenţiu, Junqueira Barbosa, Simone Diniz, Series editor, Chen, Phoebe, Series editor, Cuzzocrea, Alfredo, Series editor, Du, Xiaoyong, Series editor, Filipe, Joaquim, Series editor, Kara, Orhun, Series editor, Kotenko, Igor, Series editor, Sivalingam, Krishna M., Series editor, Ślęzak, Dominik, Series editor, Washio, Takashi, Series editor, Yang, Xiaokang, Series editor, Kotulski, Zbigniew, editor, Księżopolski, Bogdan, editor, and Mazur, Katarzyna, editor

Published
2014
Full Text
View/download PDF

18. Complexity of Anonymity for Security Protocols

Author

Ţiplea, Ferucio Laurenţiu, Vamanu, Loredana, Vârlan, Cosmin, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Gritzalis, Dimitris, editor, Preneel, Bart, editor, and Theoharidou, Marianthi, editor

Published
2010
Full Text
View/download PDF

27. Privacy and Reader-first Authentication in Vaudenay's RFID Model with Temporary State Disclosure.

Author

Ţiplea, Ferucio Laurenţiu, Hristea, Cristian, and Bulai, Rodica

Subjects
*DISCLOSURE, *PRIVACY, *POLITICAL corruption, *RADIO frequency identification systems, *COMPUTER security
Abstract

Privacy and mutual authentication under corruption with temporary state disclosure are two significant requirements for real-life applications of RFID schemes. This paper proposes two practical RFID schemes that meet these requirements. They differ from other similar schemes in that they provide reader-first authentication. Regarding privacy, our first scheme achieves destructive privacy, while the second one - narrow destructive privacy in Vaudenay's model with temporary state disclosure. To achieve these privacy levels, we use Physically Unclonable Functions (PUFs) to assure that the internal secret of the tag remains hidden from an adversary with invasive capabilities. Both of our schemes avoid the use of random generators on tags. Detailed security and privacy proofs are provided. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

31. Efficient Generation of Roots of Power Residues Modulo Powers of Two.

Author

Ţiplea, Ferucio Laurenţiu

Subjects
*INTEGERS
Abstract

We propose a characterization for the roots of power residues modulo powers of two. By this characterization, the remainder of dividing a root by a power of two is uniformly distributed in a set with two odd integers, while the quotient is uniformly distributed in an initial segment of positive integers. This property allows us to generate roots of power residues modulo powers of two efficiently. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

34. A BRIEF INTRODUCTION TO QUADRATIC RESIDUOSITY BASED CRYPTOGRAPHY.

Author

ŢIPLEA, FERUCIO LAURENŢIU

Subjects
CONGRUENCES & residues, CRYPTOGRAPHY, DATA encryption, QUADRATIC equations, INTEGERS
Abstract

The quadratic residuosity problem is the problem to distinguish between the dis-tributions of quadratic residues and quadratic non-residues modulo a composite integer. The intractability of the quadratic residuosity problem is the basis for the security of numerous constructions in cryptography, including public-key en-cryption schemes, pseudo-random generators, or cryptographic protocols. The aim of this talk is to provide a brief overview on the quadratic residuosity problem and its applications to cryptography. [ABSTRACT FROM AUTHOR]

Published
2021

36. On Anonymization of Cocks? Identity-based Encryption Scheme.

Author

Nica, Anca-Maria and Ţiplea, Ferucio Laurenţiu

Subjects
*CONGRUENCES & residues
Abstract

Cocks' identity-based encryption (IBE) scheme is the first IBE scheme that avoids the use of bilinear maps. Based on quadratic residues and due to its simplicity, the scheme gained much atten- tion from researchers. Unfortunately, the scheme is not anony- mous in the sense that the cryptotexts may reveal the identities for which they have been computed. Several anonymous variants of it have then been proposed. In this paper we revise Joye's approach to the anonymization of the Cocks' IBE scheme. Due to some recent results on the distribution of quadratic residues, we present a very simple and direct approach that leads to Joye's scheme. [ABSTRACT FROM AUTHOR]

Published
2019

38. Preface

Author

Dima, Cătălin, Minea, Marius, Ţiplea, Ferucio Laurenţiu, Laboratoire d'Algorithmique Complexité et Logique (LACL), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12)-Centre National de la Recherche Scientifique (CNRS), Department of Computing, and Politehnica University of Timisoara (UPT)

Subjects
General Computer Science, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020207 software engineering, [INFO]Computer Science [cs], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, ComputingMilieux_MISCELLANEOUS, Computer Science(all), Theoretical Computer Science
Abstract

International audience; no abstract

Published
2007

39. On the Complexity of a Problem on Monadic String Rewriting Systems

Author

Ţiplea, Ferucio Laurenţiu and Mäkinen, Erkki

Subjects
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Abstract

Computing the set of descendants of a regular language $L$ with respect to a monadic string rewriting system has proved to be very useful in developing decision algorithms for various problems on finitely presented monoids and context-free grammars. Recently, Esparza et al. [7] proved $O(ps^3)$ time and $O(ps^2)$ space bounds for this problem, where $p$ is the number of rules in the monadic string rewriting system and $s$ is the number of states in the automaton accepting $L$. Using synchronized emtension systems [10, 11, 12] we provide a new insight into the problem and present an $O(pr)$ time and space solution, where $p$ is as above and $r$ is the number of rules in the grammar generating $L$., Journal of Automata, Languages and Combinatorics, Volume 7, Number 4, 2002, 599-609

Published
2002
Full Text
View/download PDF

40. Hierarchies of Petri Net Languages and a Super-Normal Form

Author

Ţiplea, Ferucio Laurenţiu and Ene, Cristian

Abstract

Some restrictions on the in- and out-degree of transitions in Petri nets are imposed, and some hierarchies of Petri net languages are obtained. For $\lambda$-labelled Petri nets a new normal form is derived. It is called the Super-Normal Form of Petri nets and it improves the Pelz's normal form, with respect to the interleaving semantics., Journal of Automata, Languages and Combinatorics, Volume 2, Number 3, 1997, 187-204

Published
1997
Full Text
View/download PDF

41. Processes and Vectorial Characterizations of Parallel Communicating Grammar Systems

Author

Ţiplea, Ferucio Laurenţiu, Katsura, Masashi, and Ito, Masami

Abstract

This paper deals with regular Parallel Communicating Grammar Systems (PCGS, for short) as introduced in [12], and basically it has two main parts. The first one introduces and studies processes and partial words of PCGS, while the second one gives some vectorial characterizations of sequential languages of PCGS. Processes and partial words of PCGS are defined using conflict occurrence nets, and they intend to capture concurrent behaviours, including communications, of such systems of grammars. From processes, partial words and communication partial words are derived. We show that processes and partial words of PCGS are Petri net generable, and some consequences are then obtained. The connection with regular partial languages is also made. Namely, we show that partial languages of conflict-free unsynchronized PCGS are regular partial languages. The vectorial characterizations that we present here are based on special catenations on vectors of strings, and vectorial languages. More precisely, we show that languages generated by PCGS are images of regular languages through special kinds of "substitutions" and "homomorphisms". Each section points out some open problems and possible directions for a further study., Journal of Automata, Languages and Combinatorics, Volume 2, Number 1, 1997, 47-73

Published
1997
Full Text
View/download PDF

47. Soundness for S- and A-Timed Workflow Nets Is Undecidable.

Author

Ţiplea, Ferucio Laurenţiu and Macovei, Geanina Jonela

Subjects
*WORKFLOW, *METHODS engineering, *PETRI nets, *MATHEMATICAL optimization, *MANUFACTURING process automation, *PRODUCTION methods, *DECISION making
Abstract

The main purpose of workflow management systems is to support the definition, execution, and control of workflow processes. With or without time constraints, workflow management systems should satisfy certain correctness properties. The most important and widely used is the soundness property. In this paper, we focus on the soundness property for two classes of Petri-net.based workflow management systems with time constraints, S- and A-timed workflow nets (WNs), and we show that this property is undecidable for them. The proof technique, based on the undecidability of the halting problem for deterministic counter machines, shows first that the reachability, coverability, boundedness, and quasi-liveness problems are undecidable for these two classes of timed WNs, and then, as a consequence, the undecidability of the soundness problem is derived. [ABSTRACT FROM AUTHOR]

Published
2009
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results