International Conference on Security and Cryptography for Networks最新文献

Cost-Asymmetric Memory Hard Password Hashing 成本非对称内存硬密码哈希

International Conference on Security and Cryptography for Networks Pub Date : 2022-06-26 DOI: 10.48550/arXiv.2206.12970

Wenjie Bai, Jeremiah Blocki, Mohammad Hassan Ameri

{"title":"Cost-Asymmetric Memory Hard Password Hashing","authors":"Wenjie Bai, Jeremiah Blocki, Mohammad Hassan Ameri","doi":"10.48550/arXiv.2206.12970","DOIUrl":"https://doi.org/10.48550/arXiv.2206.12970","url":null,"abstract":"In the past decade, billions of user passwords have been exposed to the dangerous threat of offline password cracking attacks. An offline attacker who has stolen the cryptographic hash of a user's password can check as many password guesses as s/he likes limited only by the resources that s/he is willing to invest to crack the password. Pepper and key-stretching are two techniques that have been proposed to deter an offline attacker by increasing guessing costs. Pepper ensures that the cost of rejecting an incorrect password guess is higher than the (expected) cost of verifying a correct password guess. This is useful because most of the offline attacker's guesses will be incorrect. Unfortunately, as we observe the traditional peppering defense seems to be incompatible with modern memory hard key-stretching algorithms such as Argon2 or Scrypt. We introduce an alternative to pepper which we call Cost-Asymmetric Memory Hard Password Authentication which benefits from the same cost-asymmetry as the classical peppering defense i.e., the cost of rejecting an incorrect password guess is larger than the expected cost to authenticate a correct password guess. When configured properly we prove that our mechanism can only reduce the percentage of user passwords that are cracked by a rational offline attacker whose goal is to maximize (expected) profit i.e., the total value of cracked passwords minus the total guessing costs. We evaluate the effectiveness of our mechanism on empirical password datasets against a rational offline attacker. Our empirical analysis shows that our mechanism can reduce significantly the percentage of user passwords that are cracked by a rational attacker by up to 10%.","PeriodicalId":376645,"journal":{"name":"International Conference on Security and Cryptography for Networks","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132886002","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

The Round Complexity of Secure Computation Against Covert Adversaries 针对隐蔽对手的安全计算的轮复杂度

International Conference on Security and Cryptography for Networks Pub Date : 2020-09-14 DOI: 10.1007/978-3-030-57990-6_30

A. Choudhuri, Vipul Goyal, Abhishek Jain

引用次数: 0

Afgjort: A Partially Synchronous Finality Layer for Blockchains Afgjort:区块链的部分同步终结层

International Conference on Security and Cryptography for Networks Pub Date : 2020-09-14 DOI: 10.1007/978-3-030-57990-6_2

Thomas Dinsdale-Young, Bernardo Magri, C. Matt, J. Nielsen, Daniel Tschudi

引用次数: 30

Multi-clients Verifiable Computation via Conditional Disclosure of Secrets 基于条件秘密披露的多客户端可验证计算

International Conference on Security and Cryptography for Networks Pub Date : 2020-09-14 DOI: 10.1007/978-3-030-57990-6_8

Rishabh Bhadauria, Carmit Hazay

引用次数: 2

Gradual GRAM and Secure Computation for RAM Programs RAM程序的渐进GRAM和安全计算

International Conference on Security and Cryptography for Networks Pub Date : 2020-09-14 DOI: 10.1007/978-3-030-57990-6_12

Carmit Hazay, Mor Lilintal

引用次数: 1

Separating Symmetric and Asymmetric Password-Authenticated Key Exchange 分离对称和非对称密码认证密钥交换

International Conference on Security and Cryptography for Networks Pub Date : 2020-09-14 DOI: 10.1007/978-3-030-57990-6_29

Julia Hesse

引用次数: 8

Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption 基于决策线性假设的等大小密文表达属性加密

International Conference on Security and Cryptography for Networks Pub Date : 2020-01-01 DOI: 10.1007/978-3-319-10879-7_17

K. Takashima

引用次数: 36

Evolving Ramp Secret-Sharing Schemes 不断发展的坡道秘密共享方案

International Conference on Security and Cryptography for Networks Pub Date : 2018-09-05 DOI: 10.1007/978-3-319-98113-0_17

A. Beimel, Hussien Othman

引用次数: 14

Unforgeable Watermarking Schemes with Public Extraction 具有公共提取的不可伪造水印方案

International Conference on Security and Cryptography for Networks Pub Date : 2018-09-05 DOI: 10.1007/978-3-319-98113-0_4

Rupeng Yang, M. Au, Junzuo Lai, Qiuliang Xu, Zuoxia Yu

引用次数: 9

More Efficient Commitments from Structured Lattice Assumptions 结构化晶格假设更有效的承诺

International Conference on Security and Cryptography for Networks Pub Date : 2018-09-05 DOI: 10.1007/978-3-319-98113-0_20

Carsten Baum, I. Damgård, Vadim Lyubashevsky, Sabine Oechsner, Chris Peikert

引用次数: 104