IACR Cryptol. ePrint Arch.最新文献_第8页

Decentralized Finance (DeFi): A Survey 分散化金融(DeFi):一项调查

IACR Cryptol. ePrint Arch. Pub Date : 2023-08-10 DOI: 10.48550/arXiv.2308.05282

Erya Jiang, Bo Qin, Qin Wang, Zhipeng Wang, Qianhong Wu, Jian Weng, Xinyu Li, Chenyang Wang, Yuhang Ding, Yanran Zhang

引用次数: 4

Resolving the Doubts: On the Construction and Use of ResNets for Side-channel Analysis 解疑:边信道分析ResNets的构建与使用

IACR Cryptol. ePrint Arch. Pub Date : 2023-07-25 DOI: 10.3390/math11153265

Sengim Karayalçın, S. Picek

{"title":"Resolving the Doubts: On the Construction and Use of ResNets for Side-channel Analysis","authors":"Sengim Karayalçın, S. Picek","doi":"10.3390/math11153265","DOIUrl":"https://doi.org/10.3390/math11153265","url":null,"abstract":"The deep learning-based side-channel analysis gave some of the most prominent side-channel attacks against protected targets in the past few years. To this end, the research community’s focus has been on creating the following: (1) powerful multilayer perceptron or convolutional neural network architectures and (2) (if possible) minimal multilayer perceptron or convolutional neural network architectures. Currently, we see that, computationally intensive hyperparameter tuning methods (e.g., Bayesian optimization or reinforcement learning) provide the best results. However, as targets with more complex countermeasures become available, these minimal architectures may be insufficient, and we will require novel deep learning approaches.This work explores how residual neural networks (ResNets) perform in side-channel analysis and how to construct deeper ResNets capable of working with larger input sizes and requiring minimal tuning. The resulting architectures, obtained by following our guidelines, are significantly deeper than commonly seen in side-channel analysis, require minimal hyperparameter tuning for specific datasets, and offer competitive performance with state-of-the-art methods across several datasets. Additionally, the results indicate that ResNets work especially well when the number of profiling traces and features in a trace is large.","PeriodicalId":13158,"journal":{"name":"IACR Cryptol. ePrint Arch.","volume":"7 1","pages":"963"},"PeriodicalIF":0.0,"publicationDate":"2023-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78887295","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

Algebraic Restriction Codes and their Applications 代数限制码及其应用

IACR Cryptol. ePrint Arch. Pub Date : 2023-07-24 DOI: 10.4230/LIPIcs.ITCS.2022.2

Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski

{"title":"Algebraic Restriction Codes and their Applications","authors":"Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski","doi":"10.4230/LIPIcs.ITCS.2022.2","DOIUrl":"https://doi.org/10.4230/LIPIcs.ITCS.2022.2","url":null,"abstract":"Consider the following problem: You have a device that is supposed to compute a linear combination of its inputs, which are taken from some finite field. However, the device may be faulty and compute arbitrary functions of its inputs. Is it possible to encode the inputs in such a way that only linear functions can be evaluated over the encodings? I.e., learning an arbitrary function of the encodings will not reveal more information about the inputs than a linear combination. In this work, we introduce the notion of algebraic restriction codes (AR codes), which constrain adversaries who might compute any function to computing a linear function. Our main result is an information-theoretic construction AR codes that restrict any class of function with a bounded number of output bits to linear functions. Our construction relies on a seed which is not provided to the adversary. While interesting and natural on its own, we show an application of this notion in cryptography. In particular, we show that AR codes lead to the first construction of rate-1 oblivious transfer with statistical sender security from the Decisional Diffie–Hellman assumption, and the first-ever construction that makes black-box use of cryptography. Previously, such protocols were known only from the LWE assumption, using non-black-box cryptographic techniques. We expect our new notion of AR codes to find further applications, e.g., in the context of non-malleability, in the future.","PeriodicalId":13158,"journal":{"name":"IACR Cryptol. ePrint Arch.","volume":"13 1","pages":"1177"},"PeriodicalIF":0.0,"publicationDate":"2023-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87440843","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}

引用次数: 2

Quantum Money from Abelian Group Actions 来自阿贝尔群行为的量子货币

IACR Cryptol. ePrint Arch. Pub Date : 2023-07-22 DOI: 10.48550/arXiv.2307.12120

Mark Zhandry

引用次数: 0

Two-Round Multi-Signatures from Okamoto Signatures 来自冈本签名的两轮多重签名

IACR Cryptol. ePrint Arch. Pub Date : 2023-07-22 DOI: 10.3390/math11143223

Kwangsu Lee, Hyoseung Kim

引用次数: 4

An attack on a key exchange protocol based on max-times and min-times algebras 对基于最大次代数和最小次代数的密钥交换协议的攻击

IACR Cryptol. ePrint Arch. Pub Date : 2023-07-21 DOI: 10.1007/s13226-023-00469-0

M. Kotov, A. Treier, Ivan Buchinskiy

引用次数: 1

Autoencoder-enabled Model Portability for Reducing Hyperparameter Tuning Efforts in Side-channel Analysis 支持自编码器的模型可移植性，以减少侧信道分析中的超参数调整工作

IACR Cryptol. ePrint Arch. Pub Date : 2023-07-21 DOI: 10.1007/s13389-023-00330-4

Marina Krček, Guilherme Perin

引用次数: 0

AutoPOI: Automated Points Of Interest Selection for Side-channel Analysis 自动兴趣点选择侧通道分析

IACR Cryptol. ePrint Arch. Pub Date : 2023-07-20 DOI: 10.1007/s13389-023-00328-y

Mick G. D. Remmerswaal, Lichao Wu, S. Tiran, N. Mentens

引用次数: 1

Binary Tree Based Forward Secure Signature Scheme in the Random Oracle Model 随机Oracle模型中基于二叉树的前向安全签名方案

IACR Cryptol. ePrint Arch. Pub Date : 2023-07-20 DOI: 10.24425/ijet.2021.137868

M. Jurkiewicz

引用次数: 1

A New RSA Variant Based on Elliptic Curves 一种基于椭圆曲线的RSA新变体

IACR Cryptol. ePrint Arch. Pub Date : 2023-07-19 DOI: 10.3390/cryptography7030037

Maher Boudabra, Abderrahmane Nitaj

引用次数: 0