Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop最新文献

Session details: Code-based and Elliptic Curve Cryptography 会议细节:基于代码和椭圆曲线密码

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop Pub Date : 2018-05-23 DOI: 10.1145/3258586

K. Emura

引用次数: 0

A New LRPC-Kronecker Product Codes Based Public-Key Cryptography 一种新的基于LRPC-Kronecker产品码的公钥加密方法

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop Pub Date : 2018-05-23 DOI: 10.1145/3197507.3197513

Jon-Lark Kim, L. Galvez, Young-Sik Kim, Nari Lee

引用次数: 2

Five-Card AND Protocol in Committed Format Using Only Practical Shuffles 五张牌和协议在承诺格式只使用实际洗牌

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop Pub Date : 2018-05-23 DOI: 10.1145/3197507.3197510

Yuta Abe, Y. Hayashi, T. Mizuki, H. Sone

{"title":"Five-Card AND Protocol in Committed Format Using Only Practical Shuffles","authors":"Yuta Abe, Y. Hayashi, T. Mizuki, H. Sone","doi":"10.1145/3197507.3197510","DOIUrl":"https://doi.org/10.1145/3197507.3197510","url":null,"abstract":"In card-based cryptography, designing AND protocols in committed format is a major topic of research. The state-of-the-art AND protocol proposed by Koch, Walzer, and Härtel in ASIACRYPT 2015 uses only four cards, which is the minimum permissible number. Their protocol»s minimality relies on somewhat complicated shuffles having non-uniform probabilities of possible outcomes. Restricting the allowed shuffles to \"practical»» ones, namely uniform closed shuffles, to our knowledge, six cards are sufficient: The six-card AND protocol proposed by Mizuki and Sone in 2009 utilizes the random bisection cut, which is a uniform and cyclic (and hence, closed) shuffle. Thus, a question has arisen: Can we improve upon this six-card protocol using only practical shuffles? In other words, whether there exists a five-card AND protocol in committed format using only uniform closed shuffles has been one of the most important open questions in this field. In this paper, we answer the question affirmatively by designing a five-card committed-format AND protocol using only practical shuffles. The shuffles that our protocol uses are random cut and random bisection cut, both of which are uniform cyclic shuffles and can be easily implemented by humans.","PeriodicalId":170582,"journal":{"name":"Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop","volume":"259 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115261054","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}

引用次数: 24

Towards Ideal Self-bilinear Map 走向理想的自双线性映射

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop Pub Date : 2018-05-23 DOI: 10.1145/3197507.3197508

Takashi Yamakawa

{"title":"Towards Ideal Self-bilinear Map","authors":"Takashi Yamakawa","doi":"10.1145/3197507.3197508","DOIUrl":"https://doi.org/10.1145/3197507.3197508","url":null,"abstract":"Bilinear maps (also called pairings) have been used for constructing various kinds of cryptographic primitives including (but not limited to) short signatures, identity-based encryption, attribute-based encryption, and non-interactive zero-knowledge proof systems. In known instantiations of cryptographic bilinear maps based on eliptic curves, source and target groups are different groups, which may restrict applications of bilinear maps. Cheon and Lee studied self-bilinear maps, which are bilinear maps whose source and target groups are identical. They showed huge potential of self-bilinear maps by showing that self-bilinear maps can be transformed into multilinear maps, which give further more cryptographic applications including (but not limited to) multiparty non-interactive key exchange, broadcast encryption, attribute-based encryption, homomorphic signatures, and obfuscation. However, they also showed a strong negative result on the existence of cryptographic self-bilinear maps. Namely, they showed that if there exists an efficiently computable self-bilinear map on a known order group, then the computational Diffie-Hellman (CDH) assumption does not hold on the group. This means that cryptographically useful self-bilinear maps do not exist on groups of known order. On the other hand, there is no negative result for self-bilinear maps on groups of unknown order. Indeed, Yamakawa et al. gave a partial positive result for self-bilinear maps on unknown order groups. Namely, they constructed self-bilinear maps with auxiliary information, which is a weaker variant of self-bilinear maps based on indistinguishability obfuscation. Though they showed that they are sufficient for some applications of self-bilinear maps, they are not as useful as \"ideal\" self-bilinear maps, which do not need auxiliary information. In this talk, we first review the construction of self-bilinear maps with auxiliary information given by Yamakawa et al. Then we consider the possibility of constructing ideal self-bilinear maps.","PeriodicalId":170582,"journal":{"name":"Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114038701","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

You Shall Not Pass! (Once Again): An IoT Application of Post-quantum Stateful Signature Schemes 你不能通过!(再一次):后量子状态签名方案的物联网应用

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop Pub Date : 2018-05-23 DOI: 10.1145/3197507.3197512

E. Bellini, Florian Caullery, Alexandros Hasikos, Marcos Manzano, Víctor Mateu

引用次数: 2

Session details: Invited Talk 会议详情:邀请演讲

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop Pub Date : 2018-05-23 DOI: 10.1145/3258584

Jae Hong Seo

引用次数: 0

Session details: Card-based Protocol, Implementation, and Authentication for IoT 会话详细信息:基于卡的协议，实现和物联网认证

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop Pub Date : 2018-05-23 DOI: 10.1145/3258585

Yohei Watanabe

引用次数: 0

On Several Verifiable Random Functions and the q-decisional Bilinear Diffie-Hellman Inversion Assumption 若干可验证随机函数及q-decision双线性Diffie-Hellman反演假设

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop Pub Date : 2018-05-23 DOI: 10.1145/3197507.3197515

S. Lauer

引用次数: 1

A Note on Subgroup Security in Pairing-Based Cryptography 基于配对的密码系统中子组安全性的一个注记

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop Pub Date : 2018-05-23 DOI: 10.1145/3197507.3197514

Tadanori Teruya

引用次数: 0

SoK: A Performance Evaluation of Cryptographic Instruction Sets on Modern Architectures 现代体系结构上密码指令集的性能评估

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop Pub Date : 2018-05-23 DOI: 10.1145/3197507.3197511

Armando Faz-Hernández, J. C. López-Hernández, A. K. S. Oliveira

{"title":"SoK: A Performance Evaluation of Cryptographic Instruction Sets on Modern Architectures","authors":"Armando Faz-Hernández, J. C. López-Hernández, A. K. S. Oliveira","doi":"10.1145/3197507.3197511","DOIUrl":"https://doi.org/10.1145/3197507.3197511","url":null,"abstract":"The latest processors have included extensions to the instruction set architecture tailored to speed up the execution of cryptographic algorithms. Like the AES New Instructions (AES-NI) that target the AES encryption algorithm, the release of the SHA New Instructions (SHA-NI), designed to support the SHA-256 hash function, introduces a new scenario for optimizing cryptographic software. In this work, we present a performance evaluation of several cryptographic algorithms, hash-based signatures and data encryption, on platforms that support AES-NI and/or SHA-NI. In particular, we revisited several optimization techniques targeting multiple-message hashing, and as a result, we reduce by 21% the running time of this task by means of a pipelined SHA-NI implementation. In public-key cryptography, multiple-message hashing is one of the critical operations of the XMSS and XMSS^MT post-quantum hash-based digital signatures. Using SHA-NI extensions, signatures are computed 4x faster; however, our pipelined SHA-NI implementation increased this speedup factor to 4.3x. For symmetric cryptography, we revisited the implementation of AES modes of operation and reduced by 12% and 7% the running time of CBC decryption and CTR encryption, respectively.","PeriodicalId":170582,"journal":{"name":"Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130290776","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}

引用次数: 5