Still wrong use of pairings in cryptography

Kiraz, Mehmet Sabır; Uzunkol, Osmanbey

doi:10.1016/j.amc.2018.03.062

Cited by 24 publications

(7 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since this pair meets CR1, we traverse the left subtree. On node (40,68,71,90), the left pair satisfies CR3, so we turn to the right pair. Since (71, 90) satisfies CR1, we traverse the right subtree.…”

Section: A 2mtree Constructionmentioning

confidence: 99%

Order-Hiding Range Query Over Encrypted Cloud Data

2022

View full text Add to dashboard Cite

Range query on encrypted data has been widely studied to achieve fast query processing while keeping data and queries secret. Prior work hides even the ordering information of the data, but sacrifices accuracy (e.g., false positives) and efficiency (e.g., exponential complexity in the domain size) as a trade-off. Moreover, hiding the order alone is not sufficient to prevent the recent database reconstruction attacks on range query abusing access pattern and volume leakage. Several countermeasures prevent such information leakage but incur practically unacceptable storage or computational overhead due to fake records embedded in the database and database re-encryption procedures. In this paper, we first propose a range query scheme RevealRE, which is highly efficient, but reveals ordering information. We then extend RevealRE to construct HideRE, a range query scheme that does not leak data ordering information while accurate (i.e., no false positives/negatives) and efficient (i.e., logarithmic search time). HideRE can mitigate the database reconstruction attacks by introducing deceptive queries, which are indistinguishable from regular queries while obfuscating the queried ranges. We experimentally confirm efficiency of our construction under various data distribution models, demonstrating the practicality. Resilience to database reconstruction attacks of our order-hiding range query scheme is formally proved.INDEX TERMS Range query, security, privacy.

show abstract

Section: A 2mtree Constructionmentioning

confidence: 99%

Order-Hiding Range Query Over Encrypted Cloud Data

2022

View full text Add to dashboard Cite

show abstract

“…Considering the complexity of the cipher context in terms of various aspects, designing a cipher algorithm should be systematic, comprehensive, and stage. To design cipher algorithms, different technologies, including mathematics, physics, biometric, biology, and social engineering, are used [ 21 , 22 ]. Also, concepts and basic sciences such as theory of numbers, Boolean functions [ 23 ], and random functions [ 24 , 25 ] are very essential.…”

Section: Cybernetic Supermodelmentioning

confidence: 99%

Leveled Design of Cryptography Algorithms Using Cybernetic Methods for Using in Telemedicine Applications

Molk

Aref

Khorshid-Doust

2021

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

The technology world is developing fast with the developments made in the hardware and software areas. Considering that privacy and security of telemedicine applications are among the main necessities of this industry, as a result, there is a need to use lightweight and practical algorithms to be used in applications in the field of telemedicine, while security have the least negative impact. The distinct and contradicting components in the design and implementation of the cryptography algorithm, to achieve various objectives in medicine-based applications, have made it a complicated system. It is natural that, without identifying the components, indices, and properties of each system component, the hardware and software resources are lost and a proper algorithm cannot be designed. Accordingly, this paper presents a leveled model of cryptography algorithms using the cybernetic method. First, the main objectives and measures in the design of the cryptography algorithms are extracted using the measure reduction methods, and some of the excess and overlapping measures are eliminated. Then, three general classes of the cryptography algorithm design and implementation measures, applications of cryptography algorithms, and cryptography implementation techniques are extracted. Since the complexity of the cryptography algorithm design is relatively high, the cybernetic methodology is used to present a supermodel to make the cryptography algorithm design objective. Such design prevents examining unnecessary details and establishes a bidirectional relationship between the main design and implementation process and the support process. This relationship provides the support requirements of the main process by the support process at each step. Finally, the Q-analysis tools are used to analyse the proposed method, and the efficiency results are represented.

show abstract

“…Some constructions of ZKRP are based on the existence of a secure bilinear map bp = (G 1 , G 2 , G t , e, g 1 , g 2 ), where G 1 , G 2 and G t are groups of sufficiently large prime order, g 1 and g 2 are generators of G 1 and G 2 respectively and e is an appropriate choice of bilinear map, satisfying the usual requirements: (i) nondegeneracy; (ii) efficiently computable and (iii) bilinearity. This cryptographic primitive is key to the constructions we will present in the next sections and it is important to remark that care must be taken when instantiating such primitive [26,53]. Barreto-Naehrig [4] elliptic curves permit to implement bilinear maps efficiently.…”

Section: Bilinear Pairingsmentioning

confidence: 99%