Journal of Cryptology最新文献_第8页

MPClan: Protocol Suite for Privacy-Conscious Computations MPClan:用于隐私意识计算的协议套件

IF 3 3区计算机科学

Journal of Cryptology Pub Date : 2022-06-24 DOI: 10.1007/s00145-023-09469-z

Nishat Koti, S. Patil, A. Patra, Ajith Suresh

引用次数: 10

Obfustopia Built on Secret-Key Functional Encryption 基于秘密密钥功能加密的模糊乌托邦

IF 3 3区计算机科学

Journal of Cryptology Pub Date : 2022-06-03 DOI: 10.1007/s00145-022-09429-z

Fuyuki Kitagawa, Ryo Nishimaki, Keisuke Tanaka

{"title":"Obfustopia Built on Secret-Key Functional Encryption","authors":"Fuyuki Kitagawa, Ryo Nishimaki, Keisuke Tanaka","doi":"10.1007/s00145-022-09429-z","DOIUrl":"https://doi.org/10.1007/s00145-022-09429-z","url":null,"abstract":"<p>We show that indistinguishability obfuscation (IO) for all circuits can be constructed solely from secret-key functional encryption (SKFE). In the construction, SKFE needs to be secure against an unbounded number of functional key queries, that is, collusion-resistant. Our strategy is to replace public-key functional encryption (PKFE) in the construction of IO proposed by Bitansky and Vaikuntanathan (FOCS 2015) with <i>puncturable SKFE</i>. Bitansky and Vaikuntanathan introduced the notion of puncturable SKFE and observed that the strategy works. However, it has not been clear whether we can construct puncturable SKFE without assuming PKFE. In particular, it has not been known whether puncturable SKFE can be constructed from standard SKFE. In this work, we show that a relaxed variant of puncturable SKFE can be constructed from collusion-resistant SKFE. Moreover, we show that the relaxed variant of puncturable SKFE is sufficient for constructing IO. Ananth and Jain (CRYPTO 2015) also proposed an IO construction from PKFE. However, their strategy is different from that of Biransky and Vaikuntanathan. In addition, we also study the relation of collusion-resistance and succinctness for SKFE. Functional encryption is said to be weakly succinct if the size of its encryption circuit is sub-linear in the size of functions. We show that collusion-resistant SKFE can be constructed from weakly succinct SKFE supporting only one functional key. By combining the above two results, we show that IO for all circuits can be constructed from weakly succinct SKFE supporting only one functional key.</p>","PeriodicalId":54849,"journal":{"name":"Journal of Cryptology","volume":"107 3","pages":""},"PeriodicalIF":3.0,"publicationDate":"2022-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138518505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An Efficient and Generic Construction for Signal’s Handshake (X3DH): Post-quantum, State Leakage Secure, and Deniable 一种高效通用的信号握手结构（X3DH）：后量子、状态泄漏安全、可否认

IF 3 3区计算机科学

Journal of Cryptology Pub Date : 2022-05-05 DOI: 10.1007/s00145-022-09427-1

Keitaro Hashimoto, Shuichi Katsumata, Kris Kwiatkowski, Thomas Prest

引用次数: 28

TinyKeys: A New Approach to Efficient Multi-Party Computation TinyKeys：一种高效多方计算的新方法

IF 3 3区计算机科学

Journal of Cryptology Pub Date : 2022-04-01 DOI: 10.1007/s00145-022-09423-5

Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez

引用次数: 1

Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices 格上的双轮n-out- n、多重签名和陷门承诺