Chosen Ciphertext Security on Hard Membership Decision Groups: The Case of Semi-smooth Subgroups of Quadratic Residues

2014 ◽  
pp. 558-577 ◽  
Author(s):  
Takashi Yamakawa ◽  
Shota Yamada ◽  
Koji Nuida ◽  
Goichiro Hanaoka ◽  
Noboru Kunihiro
Keyword(s):  
Quadratic Residues ◽  
Chosen Ciphertext Security

scholarly journals A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle

2016 ◽  
Vol 609 ◽  
pp. 253-261 ◽  
Author(s):  
Linming Gong ◽  
Shundong Li ◽  
Qing Mao ◽  
Daoshun Wang ◽  
Jiawei Dou
Keyword(s):  
Homomorphic Encryption ◽  
Random Oracle ◽  
Encryption Scheme ◽  
Chosen Ciphertext Security ◽  
Adaptive Chosen Ciphertext Security

Combiners for Chosen-Ciphertext Security

2016 ◽  
pp. 257-268 ◽  
Author(s):  
Cong Zhang ◽  
David Cash ◽  
Xiuhua Wang ◽  
Xiaoqi Yu ◽  
Sherman S. M. Chow
Keyword(s):  
Chosen Ciphertext Security

Identity oriented signature scheme based on quadratic residues

2005 ◽  
Vol 168 (1) ◽  
pp. 235-242 ◽  
Author(s):  
Weidong Qiu ◽  
Kefei Chen
Keyword(s):  
Signature Scheme ◽  
Quadratic Residues

Quadratic Residues

1986 ◽  
pp. 109-156
Author(s):  
Nikolaos Kritikos
Keyword(s):  
Quadratic Residues

scholarly journals Enhanced Chosen-Ciphertext Security and Applications

2014 ◽  
pp. 329-344 ◽  
Author(s):  
Dana Dachman-Soled ◽  
Georg Fuchsbauer ◽  
Payman Mohassel ◽  
Adam O’Neill
Keyword(s):  
Chosen Ciphertext Security

scholarly journals A New Symmetric Key Cryptographic Algorithm using Paley Graphs and ASCII Values

2021 ◽  
Vol 297 ◽  
pp. 01046
Author(s):  
Zhour Oumazouz ◽  
Driss Karim
Keyword(s):  
Brute Force ◽  
Strong Regularity ◽  
Quadratic Residues ◽  
Cryptographic Algorithm ◽  
Paley Graph ◽  
Encryption And Decryption ◽  
Symmetric Key ◽  
Brute Force Attack ◽  
The Moment ◽  
Paley Graphs

The main objective of the study conducted in this article is to introduce a new algorithm of encryption and decryption of a sensitive message after transforming it into a binary message. Our proposed encryption algorithm is based on the study of a particular graph constructed algebraically from the quadratic residues. We have exploited the Paley graph to introduce an abstract way of encryption of such message bit according to the other message bits by the intermidiate study of the neighborhood of a graph vertex. The strong regularity of the Paley graphs and the unknown behavior of the quadratic residues will play a very important role in the cryptanalysis part which allows to say that the brute force attack remains for the moment the only way to obtain the set of possible messages.

Sign in / Sign up

Export Citation Format

Share Document