2019
DOI: 10.30837/rt.2019.3.198.09
|View full text |Cite
|
Sign up to set email alerts
|

Some approach to data masking as means to counteract the inference threat

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 3 publications
0
4
0
Order By: Relevance
“…In future work, BDMasker will expand the support for AI-driven dynamic data protection and prevent malicious users from using reasoning or violence technology to bypass masking [22] . We will also study how to work out more general methods via AI so that they can be more easily adapted to big data engines.…”
Section: Discussionmentioning
confidence: 99%
“…In future work, BDMasker will expand the support for AI-driven dynamic data protection and prevent malicious users from using reasoning or violence technology to bypass masking [22] . We will also study how to work out more general methods via AI so that they can be more easily adapted to big data engines.…”
Section: Discussionmentioning
confidence: 99%
“…To encrypt/decrypt data of fields of various types of a tuple row of a certain table R of a database, a scheme is used based on the use of keys K R 1 , K j 2 , K γ 3 similar to that described in [36,37], where K R 1 is a unique 128-bit random value (secret key) generated by a cryptographically strong pseudo-random number generator (PRNG) for each table R, constant for all values that will be encrypted in this table; K j 2 is a unique 128-bit random value (secret key) generated by a cryptographically strong PRNG for each attribute j of table R; and K γ 3 is the value of the integer identifier of the primary key of the γ-th row of the table R. Secret (symmetric) keys K R 1 , K j 2 are encrypted by one of the cryptographically strong algorithms and stored in the special database table R sec . The values of these keys are never shown.…”
Section: Main Security Aspectsmentioning
confidence: 99%
“…One such solution [26] was taken as a basis. In [26], an approach to hiding data stored in a database was proposed, which is based on the principles of random permutation of elements (bytes, characters) of a specific field of the corresponding column (attribute) of a row (tuple) of data and dynamic data masking. Moreover, since the source code of SP is also stored in a certain way in the corresponding DBMS tables, this approach can be fully applied to hide it.…”
Section: Related Workmentioning
confidence: 99%
“…The general scheme of the somewhat refined masking algorithm described in [26] is presented below (Algorithm 1).…”
Section: Algorithm For Masking the Code Of Stored Programsmentioning
confidence: 99%
See 1 more Smart Citation