Zobrazeno 1 - 10 of 21 pro vyhledávání: '"Eisuke Koizumi"'
1
A construction of encryption protocols over some semidirect products
Autor: Shuji Isobe, Eisuke Koizumi
Publikováno v: Journal of Mathematical Cryptology. 17
In CANDARW ’18, Isobe et al. proposed a secure encryption protocol on non-abelian groups based on the Anshel–Anshel–Goldfeld key exchange protocol. There have remained two weak points on the protocol: one is that the protocol is indistinguishab
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::28499c9b2091f6e2c7829cb944bb042d
https://doi.org/10.1515/jmc-2022-0018
Zobrazit plný text záznamu
5
A Construction of Cramer-Shoup Like Encryption Protocols Based on the Anshel-Anshel-Goldfeld Key Exchange Protocol
Autor: Shuji Isobe, Atsushi Suda, Junya Iwazaki, Eisuke Koizumi
Publikováno v: CANDAR Workshops
We propose a secure encryption protocol on non-abelian groups. We follow the line of the construction of the Cramer-Shoup encryption protocol, which is proved to be indistinguishable against adaptive chosen ciphertext attack (IND-CCA, for short) by r
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8358703c1ed50997b978040a1ef2efaf
https://doi.org/10.1109/candarw.2018.00082
Zobrazit plný text záznamu
8
A Method for Constructing an Autonomous Decentralized P2P Storage with High Confidentiality and Reliability
Autor: Masayuki Fukumitsu, Masao Sakai, Shingo Hasegawa, Eisuke Koizumi, Shuji Isobe, Junya Iwazaki
Publikováno v: CANDAR
We have proposed a decentralized Peer-to-Peer (P2P) cloud storage scheme achieving high confidentiality by using a large number of unspecified P2P nodes. There is one crucial problem in the scheme: it is generally difficult to maintain the reliabilit
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::d61392129b2a198083964ae2828b9768
https://doi.org/10.1109/candar.2017.67
Zobrazit plný text záznamu
9
On the Complexity of Computing Discrete Logarithms over Algebraic Tori
Autor: Yuji Nishigaki, Hiroki Shizuya, Shuji Isobe, Eisuke Koizumi
Publikováno v: IEICE Transactions on Information and Systems. :442-447
This paper studies the complexity of computing discrete logarithms over algebraic tori. We show that the order certified version of the discrete logarithm over general finite fields (OCDL, in symbols) reduces to the discrete logarithm over algebraic
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e9a76125a005ddad6fd90a0dfee77e74
https://doi.org/10.1587/transinf.e97.d.442
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje