当前期刊: Journal of Cryptology Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Foundations of Fully Dynamic Group Signatures
    J. Cryptol. (IF 1.237) Pub Date : 2020-06-02
    Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth

    Group signatures allow members of a group to anonymously sign on behalf of the group. Membership is administered by a designated group manager. The group manager can also reveal the identity of a signer if and when needed to enforce accountability and deter abuse. For group signatures to be applicable in practice, they need to support fully dynamic groups, i.e., users may join and leave at any time

    更新日期:2020-06-02
  • Joint State Composition Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
    J. Cryptol. (IF 1.237) Pub Date : 2020-05-29
    Ralf Küsters, Max Tuengerthal, Daniel Rausch

    In frameworks for universal composability, complex protocols can be built from sub-protocols in a modular way using composition theorems. However, as first pointed out and studied by Canetti and Rabin, this modular approach often leads to impractical implementations. For example, when using a functionality for digital signatures within a more complex protocol, parties have to generate new verification

    更新日期:2020-05-29
  • Oblivious Sampling with Applications to Two-Party k -Means Clustering
    J. Cryptol. (IF 1.237) Pub Date : 2020-05-12
    Paul Bunn, Rafail Ostrovsky

    The k-means clustering problem is one of the most explored problems in data mining. With the advent of protocols that have proven to be successful in performing single database clustering, the focus has shifted in recent years to the question of how to extend the single database protocols to a multiple database setting. To date, there have been numerous attempts to create specific multiparty k-means

    更新日期:2020-05-12
  • Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions
    J. Cryptol. (IF 1.237) Pub Date : 2020-04-22
    Susumu Kiyoshima

    Concurrent non-malleable zero-knowledge (\(\mathrm {CNMZK}\)) protocols are zero-knowledge protocols that provides security even when adversaries interact with multiple provers and verifiers simultaneously. It is known that \(\mathrm {CNMZK}\) arguments for \(\mathcal {NP}\) can be constructed in the plain model. Furthermore, it was recently shown that statistical\(\mathrm {CNMZK}\) arguments for \(\mathcal

    更新日期:2020-04-23
  • Efficient and Scalable Universal Circuits
    J. Cryptol. (IF 1.237) Pub Date : 2020-04-08
    Masaud Y. Alhassan, Daniel Günther, Ágnes Kiss, Thomas Schneider

    A universal circuit (UC) can be programmed to simulate any circuit up to a given size n by specifying its program inputs. It provides elegant solutions in various application scenarios, e.g., for private function evaluation (PFE) and for improving the flexibility of attribute-based encryption schemes. The asymptotic lower bound for the size of a UC is \(\Omega (n\log n)\), and Valiant (STOC’76) provided

    更新日期:2020-04-23
  • From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
    J. Cryptol. (IF 1.237) Pub Date : 2019-09-30
    Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs

    Functional encryption lies at the frontiers of the current research in cryptography; some variants have been shown sufficiently powerful to yield indistinguishability obfuscation (IO), while other variants have been constructed from standard assumptions such as LWE. Indeed, most variants have been classified as belonging to either the former or the latter category. However, one mystery that has remained

    更新日期:2020-04-23
  • Revisiting the Wrong-Key-Randomization Hypothesis
    J. Cryptol. (IF 1.237) Pub Date : 2020-02-11
    Tomer Ashur, Tim Beyne, Vincent Rijmen

    Linear cryptanalysis is considered to be one of the strongest techniques in the cryptanalyst’s arsenal. In most cases, Matsui’s Algorithm 2 is used for the key recovery part of the attack. The success rate analysis of this algorithm is based on an assumption regarding the bias of a linear approximation for a wrong key, known as the wrong-key-randomization hypothesis. This hypothesis was refined by

    更新日期:2020-04-23
  • Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
    J. Cryptol. (IF 1.237) Pub Date : 2019-09-04
    Nir Bitansky

    Verifiable random functions (VRFs) are pseudorandom functions where the owner of the seed, in addition to computing the function’s value y at any point x, can also generate a non-interactive proof \(\pi \) that y is correct, without compromising pseudorandomness at other points. Being a natural primitive with a wide range of applications, considerable efforts have been directed toward the construction

    更新日期:2020-04-23
  • Feasibility and Infeasibility of Secure Computation with Malicious PUFs
    J. Cryptol. (IF 1.237) Pub Date : 2019-07-09
    Dana Dachman-Soled, Nils Fleischhacker, Jonathan Katz, Anna Lysyanskaya, Dominique Schröder

    A recent line of work has explored the use of physically unclonable functions (PUFs) for secure computation, with the goals of (1) achieving universal composability without additional setup and/or (2) obtaining unconditional security (i.e., avoiding complexity-theoretic assumptions). Initial work assumed that all PUFs, even those created by an attacker, are honestly generated. Subsequently, researchers

    更新日期:2020-04-23
  • From Minicrypt to Obfustopia via Private-Key Functional Encryption
    J. Cryptol. (IF 1.237) Pub Date : 2019-06-12
    Ilan Komargodski, Gil Segev

    Private-key functional encryption enables fine-grained access to symmetrically encrypted data. Although private-key functional encryption (supporting an unbounded number of keys and ciphertexts) seems significantly weaker than its public-key variant, its known realizations all rely on public-key functional encryption. At the same time, however, up until recently it was not known to imply any public-key

    更新日期:2020-04-23
  • CryptHOL: Game-Based Proofs in Higher-Order Logic
    J. Cryptol. (IF 1.237) Pub Date : 2020-01-06
    David A. Basin, Andreas Lochbihler, S. Reza Sefidgar

    Game-based proofs are a well-established paradigm for structuring security arguments and simplifying their understanding. We present a novel framework, CryptHOL, for rigorous game-based proofs that is supported by mechanical theorem proving. CryptHOL is based on a new semantic domain with an associated functional programming language for expressing games. We embed our framework in the Isabelle/HOL

    更新日期:2020-04-23
  • Tight Security of Cascaded LRW2
    J. Cryptol. (IF 1.237) Pub Date : 2020-03-05
    Ashwin Jha, Mridul Nandi

    At CRYPTO ’12, Landecker et al. introduced the cascaded LRW2 (or CLRW2) construction and proved that it is a secure tweakable block cipher up to roughly \( 2^{2n/3} \) queries. Recently, Mennink has presented a distinguishing attack on CLRW2 in \( 2n^{1/2}2^{3n/4} \) queries. In the same paper, he discussed some non-trivial bottlenecks in proving tight security bound, i.e., security up to \( 2^{3n/4}

    更新日期:2020-04-23
  • Meet-in-the-Middle Attacks and Structural Analysis of Round-Reduced PRINCE
    J. Cryptol. (IF 1.237) Pub Date : 2020-03-04
    Patrick Derbez, Léo Perrin

    NXP Semiconductors and its academic partners challenged the cryptographic community with finding practical attacks on the block cipher they designed, PRINCE. Instead of trying to attack as many rounds as possible using attacks which are usually impractical despite being faster than brute force, the challenge invites cryptographers to find practical attacks and encourages them to actually implement

    更新日期:2020-04-23
  • Block Cipher Invariants as Eigenvectors of Correlation Matrices
    J. Cryptol. (IF 1.237) Pub Date : 2020-02-14
    Tim Beyne

    A new approach to invariant subspaces and nonlinear invariants is developed. This results in both theoretical insights and practical attacks on block ciphers. It is shown that, with minor modifications to some of the round constants, Midori-64 has a nonlinear invariant with \(2^{96} + 2^{64}\) corresponding weak keys. Furthermore, this invariant corresponds to a linear hull with maximal correlation

    更新日期:2020-04-23
  • Spin Me Right Round Rotational Symmetry for FPGA-Specific AES: Extended Version
    J. Cryptol. (IF 1.237) Pub Date : 2020-01-22
    Felix Wegener, Lauren De Meyer, Amir Moradi

    The effort in reducing the area of AES implementations has largely been focused on application-specific integrated circuits (ASICs) in which a tower field construction leads to a small design of the AES S-box. In contrast, a naive implementation of the AES S-box has been the status-quo on field-programmable gate arrays (FPGAs). A similar discrepancy holds for masking schemes—a well-known side-channel

    更新日期:2020-04-23
  • Multilinear Maps from Obfuscation
    J. Cryptol. (IF 1.237) Pub Date : 2020-01-02
    Martin R. Albrecht, Pooya Farshim, Shuai Han, Dennis Hofheinz, Enrique Larraia, Kenneth G. Paterson

    We provide constructions of multilinear groups equipped with natural hard problems from indistinguishability obfuscation, homomorphic encryption, and NIZKs. This complements known results on the constructions of indistinguishability obfuscators from multilinear maps in the reverse direction. We provide two distinct, but closely related constructions and show that multilinear analogues of the \({\text

    更新日期:2020-04-23
  • Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems
    J. Cryptol. (IF 1.237) Pub Date : 2019-03-27
    Steven D. Galbraith, Christophe Petit, Javier Silva

    We present signature schemes whose security relies on computational assumptions relating to isogeny graphs of supersingular elliptic curves. We give two schemes, both of them based on interactive identification protocols. The first identification protocol is due to De Feo, Jao and Plût. The second one, and the main contribution of the paper, makes novel use of an algorithm of Kohel, Lauter, Petit and

    更新日期:2020-04-23
  • On the Power of Secure Two-Party Computation
    J. Cryptol. (IF 1.237) Pub Date : 2019-02-07
    Carmit Hazay, Muthuramakrishnan Venkitasubramaniam

    Ishai, Kushilevitz, Ostrovsky and Sahai (STOC 2007; SIAM J Comput 39(3):1121–1152, 2009) introduced the powerful “MPC-in-the-head” technique that provided a general transformation of information-theoretic MPC protocols secure against passive adversaries to a ZK proof in a “black-box” way. In this work, we extend this technique and provide a generic transformation of any semi-honest secure two-party

    更新日期:2020-04-23
  • TFHE: Fast Fully Homomorphic Encryption Over the Torus
    J. Cryptol. (IF 1.237) Pub Date : 2019-04-25
    Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène

    This work describes a fast fully homomorphic encryption scheme over the torus (TFHE) that revisits, generalizes and improves the fully homomorphic encryption (FHE) based on GSW and its ring variants. The simplest FHE schemes consist in bootstrapped binary gates. In this gate bootstrapping mode, we show that the scheme FHEW of Ducas and Micciancio (Eurocrypt, 2015) can be expressed only in terms of

    更新日期:2020-04-23
  • Locally Decodable and Updatable Non-malleable Codes and Their Applications
    J. Cryptol. (IF 1.237) Pub Date : 2018-11-27
    Dana Dachman-Soled, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou

    Non-malleable codes, introduced as a relaxation of error-correcting codes by Dziembowski, Pietrzak, and Wichs (ICS ’10), provide the security guarantee that the message contained in a tampered codeword is either the same as the original message or is set to an unrelated value. Various applications of non-malleable codes have been discovered, and one of the most significant applications among these

    更新日期:2020-04-23
  • Solving LPN Using Covering Codes
    J. Cryptol. (IF 1.237) Pub Date : 2019-10-15
    Qian Guo, Thomas Johansson, Carl Löndahl

    We present a new algorithm for solving the LPN problem. The algorithm has a similar form as some previous methods, but includes a new key step that makes use of approximations of random words to a nearest codeword in a linear code. It outperforms previous methods for many parameter choices. In particular, we can now solve the \((512,\frac{1}{8})\) LPN instance with complexity less than \(2^{80}\) operations

    更新日期:2020-04-23
  • Practical Collision Attacks against Round-Reduced SHA-3
    J. Cryptol. (IF 1.237) Pub Date : 2019-02-13
    Jian Guo, Guohong Liao, Guozhen Liu, Meicheng Liu, Kexin Qiao, Ling Song

    The Keccak hash function is the winner of the SHA-3 competition (2008–2012) and became the SHA-3 standard of NIST in 2015. In this paper, we focus on practical collision attacks against round-reduced SHA-3 and some Keccak variants. Following the framework developed by Dinur et al. at FSE 2012 where 4-round collisions were found by combining 3-round differential trails and 1-round connectors, we extend

    更新日期:2020-04-23
  • Topology-Hiding Computation on All Graphs
    J. Cryptol. (IF 1.237) Pub Date : 2019-03-15
    Adi Akavia, Rio LaVigne, Tal Moran

    A distributed computation in which nodes are connected by a partial communication graph is called topology hiding if it does not reveal information about the graph beyond what is revealed by the output of the function. Previous results have shown that topology-hiding computation protocols exist for graphs of constant degree and logarithmic diameter in the number of nodes (Moran–Orlov–Richelson, TCC’15;

    更新日期:2020-04-23
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
Springer化学材料学
骄傲月
如何通过Nature平台传播科研成果
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
南开大学
朱守非
廖良生
郭东升
汪铭
伊利诺伊大学香槟分校
徐明华
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug