Journal of Mathematical Cryptology最新文献_第6页

On the condition number of the Vandermonde matrix of the nth cyclotomic polynomial 关于第n个分圆多项式的Vandermonde矩阵的条件数

IF 1.2

Journal of Mathematical Cryptology Pub Date : 2020-02-19 DOI: 10.1515/jmc-2020-0009

A. J. Scala, C. Sanna, Edoardo Signorini

引用次数: 6

Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem 近似最大公约数问题的CRT变体算法

IF 1.2

Journal of Mathematical Cryptology Pub Date : 2020-01-01 DOI: 10.1515/jmc-2019-0031

J. Cheon, Wonhee Cho, Minki Hhan, Minsik Kang, Jiseung Kim, Changmin Lee

{"title":"Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem","authors":"J. Cheon, Wonhee Cho, Minki Hhan, Minsik Kang, Jiseung Kim, Changmin Lee","doi":"10.1515/jmc-2019-0031","DOIUrl":"https://doi.org/10.1515/jmc-2019-0031","url":null,"abstract":"Abstract The approximate greatest common divisor problem (ACD) and its variants have been used to construct many cryptographic primitives. In particular, the variants of the ACD problem based on Chinese remainder theorem (CRT) are being used in the constructions of a batch fully homomorphic encryption to encrypt multiple messages in one ciphertext. Despite the utility of the CRT-variant scheme, the algorithms that secures its security foundation have not been probed well enough. In this paper, we propose two algorithms and the results of experiments in which the proposed algorithms were used to solve the variant problem. Both algorithms take the same time complexity 2O~(γ(η−ρ)2) $begin{array}{} displaystyle 2^{tilde{O}(frac{gamma}{(eta-rho)^2})} end{array}$ up to a polynomial factor to solve the variant problem for the bit size of samples γ, secret primes η, and error bound ρ. Our algorithm gives the first parameter condition related to η and γ size. From the results of the experiments, it has been proved that the proposed algorithms work well both in theoretical and experimental terms.","PeriodicalId":43866,"journal":{"name":"Journal of Mathematical Cryptology","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jmc-2019-0031","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43400518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Flattening NTRU for Evaluation Key Free Homomorphic Encryption 评估无密钥同态加密的平坦化NTRU

IF 1.2

Journal of Mathematical Cryptology Pub Date : 2020-01-01 DOI: 10.1515/jmc-2015-0052

Yarkin Doröz, B. Sunar

引用次数: 35

CHIMERA: Combining Ring-LWE-based Fully Homomorphic Encryption Schemes CHIMERA:结合基于环- lwe的全同态加密方案

IF 1.2

Journal of Mathematical Cryptology Pub Date : 2020-01-01 DOI: 10.1515/jmc-2019-0026

Christina Boura, Nicolas Gama, Mariya Georgieva, Dimitar Jetchev

引用次数: 73

New Zémor-Tillich Type Hash Functions Over GL2 (𝔽pn) GL2上新的Zémor-Ttilich型散列函数(𝔽pn）

IF 1.2

Journal of Mathematical Cryptology Pub Date : 2020-01-01 DOI: 10.1515/jmc-2019-0033

H. Tomkins, M. Nevins, Hadi Salmasian

引用次数: 3

Protecting ECC Against Fault Attacks: The Ring Extension Method Revisited 保护ECC免受故障攻击:重述环扩展方法

IF 1.2

Journal of Mathematical Cryptology Pub Date : 2020-01-01 DOI: 10.1515/jmc-2019-0030

M. Joye

引用次数: 6

Characterizing overstretched NTRU attacks 过度扩展NTRU攻击特征

IF 1.2

Journal of Mathematical Cryptology Pub Date : 2020-01-01 DOI: 10.1515/jmc-2015-0055

Gabrielle De Micheli, N. Heninger, Barak Shani

引用次数: 1

Delegating a Product of Group Exponentiations with Application to Signature Schemes (Submission to Special NutMiC 2019 Issue of JMC) 委托群指数的乘积应用于签名方案（提交给JMC 2019年特别版NutMiC）

IF 1.2

Journal of Mathematical Cryptology Pub Date : 2020-01-01 DOI: 10.1515/jmc-2019-0036

G. D. Crescenzo, Matluba Khodjaeva, Delaram Kahrobaei, V. Shpilrain

{"title":"Delegating a Product of Group Exponentiations with Application to Signature Schemes (Submission to Special NutMiC 2019 Issue of JMC)","authors":"G. D. Crescenzo, Matluba Khodjaeva, Delaram Kahrobaei, V. Shpilrain","doi":"10.1515/jmc-2019-0036","DOIUrl":"https://doi.org/10.1515/jmc-2019-0036","url":null,"abstract":"Abstract Many public-key cryptosystems and, more generally, cryptographic protocols, use group exponentiations as important primitive operations. To expand the applicability of these solutions to computationally weaker devices, it has been advocated that a computationally weaker client (i.e., capable of performing a relatively small number of modular multiplications) delegates such primitive operations to a computationally stronger server. Important requirements for such delegation protocols include privacy of the client’s input exponent and security of the client’s output, in the sense of detecting, except for very small probability, any malicious server’s attempt to convince the client of an incorrect exponentiation result. Only recently, efficient protocols for the delegation of a fixed-based exponentiation, over cyclic and RSA-type groups with certain properties, have been presented and proved to satisfy both requirements. In this paper we show that a product of many fixed-base exponentiations, over a cyclic groups with certain properties, can be privately and securely delegated by keeping the client’s online number of modular multiplications only slightly larger than in the delegation of a single exponentiation. We use this result to show the first delegations of entire cryptographic schemes: the well-known digital signature schemes by El-Gamal, Schnorr and Okamoto, over the q-order subgroup in ℤp, for p, q primes, as well as their variants based on elliptic curves. Previous efficient delegation results were limited to the delegation of single algorithms within cryptographic schemes.","PeriodicalId":43866,"journal":{"name":"Journal of Mathematical Cryptology","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jmc-2019-0036","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47239106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

New approach to practical leakage-resilient public-key cryptography 实用防泄漏公钥加密的新方法

IF 1.2

Journal of Mathematical Cryptology Pub Date : 2020-01-01 DOI: 10.1515/jmc-2019-0014

Suvradip Chakraborty, Janaka Alawatugoda, C. Rangan

{"title":"New approach to practical leakage-resilient public-key cryptography","authors":"Suvradip Chakraborty, Janaka Alawatugoda, C. Rangan","doi":"10.1515/jmc-2019-0014","DOIUrl":"https://doi.org/10.1515/jmc-2019-0014","url":null,"abstract":"Abstract We present a new approach to construct several leakage-resilient cryptographic primitives, including leakage-resilient public-key encryption (PKE) schemes, authenticated key exchange (AKE) protocols and low-latency key exchange (LLKE) protocols. To this end, we introduce a new primitive called leakage-resilient non-interactive key exchange (LR-NIKE) protocol. We introduce an appropriate security model for LR-NIKE protocols in the bounded memory leakage (BML) settings. We then show a secure construction of the LR-NIKE protocol in the BML setting that achieves an optimal leakage rate, i.e., 1 – o(1). Our construction of LR-NIKE requires a minimal use of a leak-free hardware component. We argue that the use of such a leak-free hardware component seems to be unavoidable in any construction of an LR-NIKE protocol, even in the BML setting. Finally, we show how to construct the aforementioned leakage-resilient primitives from such an LR-NIKE protocol as summarized below. All these primitives also achieve the same (optimal) leakage rate as the underlying LR-NIKE protocol. We show how to construct a leakage-resilient (LR) IND-CCA-2-secure PKE scheme in the BML model generically from a bounded LR-NIKE (BLR-NIKE) protocol. Our construction of LR-IND-CCA-2 secure PKE differs significantly from the state-of-the-art constructions of these primitives, which mainly use hash proof techniques to achieve leakage resilience. Moreover, our transformation preserves the leakage-rate of the underlying BLR-NIKE protocol. We introduce a new leakage model for AKE protocols, in the BML setting, and present a leakage-resilient AKE protocol construction from the LR-NIKE protocol. We introduce the first-ever leakage model for LLKE protocols in the BML setting and the first construction of such a leakage-resilient LLKE from the LR-NIKE protocol.","PeriodicalId":43866,"journal":{"name":"Journal of Mathematical Cryptology","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jmc-2019-0014","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48688787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Equidistribution Among Cosets of Elliptic Curve Points in Intervals 区间中椭圆曲线点的余弦的等距分布

IF 1.2

Journal of Mathematical Cryptology Pub Date : 2020-01-01 DOI: 10.1515/jmc-2019-0020

Taechan Kim, Mehdi Tibouchi

引用次数: 3