-
Bandwidth-Hard Functions: Reductions and Lower Bounds J. Cryptol. (IF 3.0) Pub Date : 2024-03-12 Jeremiah Blocki, Peiyuan Liu, Ling Ren, Samson Zhou
-
The COLM Authenticated Encryption Scheme J. Cryptol. (IF 3.0) Pub Date : 2024-03-07
Abstract In this work we present the COLM authenticated encryption (AE) scheme which is the second of the two winners in the defense in depth category of the CAESAR competition. COLM realizes a nonce-based authenticated encryption with associated data and uses the popular AES blockcipher as its underlying primitive. We propose two possible blockcipher instantiations (with key of length 128 or 256 bits)
-
Collision Resistance from Multi-collision Resistance J. Cryptol. (IF 3.0) Pub Date : 2024-03-06
Abstract Collision-resistant hash functions ( \(\textsf{CRH}\) ) are a fundamental and ubiquitous cryptographic primitive. Several recent works have studied a relaxation of \(\textsf{CRH}\) called t-way multi-collision-resistant hash functions ( \(t\text {-}\textsf{MCRH}\) ). These are families of functions for which it is computationally hard to find a t-way collision, even though such collisions
-
Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting J. Cryptol. (IF 3.0) Pub Date : 2024-02-29 Dennis Hofheinz, Jessica Koch, Christoph Striecks
-
Entropy Computation for Oscillator-based Physical Random Number Generators J. Cryptol. (IF 3.0) Pub Date : 2024-02-29 David Lubicz, Viktor Fischer
-
Hashing to Elliptic Curves Through Cipolla–Lehmer–Müller’s Square Root Algorithm J. Cryptol. (IF 3.0) Pub Date : 2024-02-27
Abstract The present article provides a novel hash function \({\mathcal {H}}\) to any elliptic curve of j-invariant \(\ne 0, 1728\) over a finite field \({\mathbb {F}}_{\!q}\) of large characteristic. The unique bottleneck of \({\mathcal {H}}\) consists of extracting a square root in \({\mathbb {F}}_{\!q}\) as well as for most hash functions. However, \({\mathcal {H}}\) is designed in such a way that
-
Time-Space Lower Bounds for Finding Collisions in Merkle–Damgård Hash Functions J. Cryptol. (IF 3.0) Pub Date : 2024-02-13 Akshima, Siyao Guo, Qipeng Liu
-
Robust Channels: Handling Unreliable Networks in the Record Layers of QUIC and DTLS 1.3 J. Cryptol. (IF 3.0) Pub Date : 2024-01-30 Marc Fischlin, Felix Günther, Christian Janson
-
(Inner-Product) Functional Encryption with Updatable Ciphertexts J. Cryptol. (IF 3.0) Pub Date : 2023-12-15 Valerio Cini, Sebastian Ramacher, Daniel Slamanig, Christoph Striecks, Erkan Tairi
-
-
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation J. Cryptol. (IF 3.0) Pub Date : 2023-12-04 Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot
-
Masking the GLP Lattice-Based Signature Scheme at Any Order J. Cryptol. (IF 3.0) Pub Date : 2023-11-29 Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, Mehdi Tibouchi
-
Lattice-Based Programmable Hash Functions and Applications J. Cryptol. (IF 3.0) Pub Date : 2023-11-29 Jiang Zhang, Yu Chen, Zhenfeng Zhang
-
BLEACH: Cleaning Errors in Discrete Computations Over CKKS J. Cryptol. (IF 3.0) Pub Date : 2023-11-01 Nir Drucker, Guy Moshkowich, Tomer Pelleg, Hayim Shaul
-
Breaking the $$O(\sqrt{n})$$ -Bit Barrier: Byzantine Agreement with Polylog Bits Per Party J. Cryptol. (IF 3.0) Pub Date : 2023-10-27 Elette Boyle, Ran Cohen, Aarushi Goel
-
Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via Obfuscation J. Cryptol. (IF 3.0) Pub Date : 2023-10-18 Yuval Ishai, Alexis Korb, Paul Lou, Amit Sahai
-
Rinocchio: SNARKs for Ring Arithmetic J. Cryptol. (IF 3.0) Pub Date : 2023-10-13 Chaya Ganesh, Anca Nitulescu, Eduardo Soria-Vazquez
-
Non-malleable Vector Commitments via Local Equivocability J. Cryptol. (IF 3.0) Pub Date : 2023-09-26 Lior Rotem, Gil Segev
-
Topology-Hiding Communication from Minimal Assumptions J. Cryptol. (IF 3.0) Pub Date : 2023-09-12 Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran
-
Revisiting Mutual Information Analysis: Multidimensionality, Neural Estimation and Optimality Proofs J. Cryptol. (IF 3.0) Pub Date : 2023-08-23 Valence Cristiani, Maxime Lecomte, Philippe Maurine
-
Compact Structure-Preserving Signatures with Almost Tight Security J. Cryptol. (IF 3.0) Pub Date : 2023-08-10 Masayuki Abe, Dennis Hofheinz, Ryo Nishimaki, Miyako Ohkubo, Jiaxin Pan
-
Fiat–Shamir Transformation of Multi-Round Interactive Proofs (Extended Version) J. Cryptol. (IF 3.0) Pub Date : 2023-08-08 Thomas Attema, Serge Fehr, Michael Klooß
-
A Theoretical Framework for the Analysis of Physical Unclonable Function Interfaces and Its Relation to the Random Oracle Model J. Cryptol. (IF 3.0) Pub Date : 2023-08-03 Marten van Dijk, Chenglu Jin
-
Breaking and Fixing Garbled Circuits When a Gate has Duplicate Input Wires J. Cryptol. (IF 3.0) Pub Date : 2023-08-03 Raine Nieminen, Thomas Schneider
-
Fine-Grained Secure Attribute-Based Encryption J. Cryptol. (IF 3.0) Pub Date : 2023-08-03 Yuyu Wang, Jiaxin Pan, Yu Chen
-
Cover Attacks for Elliptic Curves over Cubic Extension Fields J. Cryptol. (IF 3.0) Pub Date : 2023-07-20 Song Tian
We give a new approach to the elliptic curve discrete logarithm problem over cubic extension fields \({\mathbb {F}}_{q^3}\). It is based on a transfer: First an \({\mathbb {F}}_q\)-rational \((\ell ,\ell ,\ell )\)-isogeny from the Weil restriction of the elliptic curve under consideration with respect to \({\mathbb {F}}_{q^3}/{\mathbb {F}}_q\) to the Jacobian variety of a genus three curve over \({\mathbb
-
Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic J. Cryptol. (IF 3.0) Pub Date : 2023-07-11 Mariya Georgieva Belorgey, Sergiu Carpov, Kevin Deforth, Dimitar Jetchev, Abson Sae-Tang, Marius Vuille, Nicolas Gama, Jon Katz, Iraklis Leontiadis, Mohsen Mohammadi
-
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation J. Cryptol. (IF 3.0) Pub Date : 2023-06-29 Arpita Patra, Divya Ravi
-
Unbounded Predicate Inner Product Functional Encryption from Pairings J. Cryptol. (IF 3.0) Pub Date : 2023-06-13 Uddipana Dowerah, Subhranil Dutta, Aikaterini Mitrokotsa, Sayantan Mukherjee, Tapas Pal
-
Parameter Optimization and Larger Precision for (T)FHE J. Cryptol. (IF 3.0) Pub Date : 2023-06-09 Loris Bergerat, Anas Boudi, Quentin Bourgerie, Ilaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap
-
Candidate iO from Homomorphic Encryption Schemes J. Cryptol. (IF 3.0) Pub Date : 2023-06-08 Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta
-
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model J. Cryptol. (IF 3.0) Pub Date : 2023-06-08 Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
-
On the Power of an Honest Majority in Three-Party Computation Without Broadcast J. Cryptol. (IF 3.0) Pub Date : 2023-06-07 Bar Alon, Ran Cohen, Eran Omri, Tom Suad
-
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious J. Cryptol. (IF 3.0) Pub Date : 2023-06-07 Bar Alon, Eran Omri
An \(\alpha \)-fair coin-tossing protocol allows a set of mutually distrustful parties to generate a uniform bit, such that no efficient adversary can bias the output bit by more than \(\alpha \). Cleve (in: Proceedings of the 18th annual ACM symposium on theory of computing (STOC), 1986) has shown that if half of the parties can be corrupted, then no \(r\)-round coin-tossing protocol is \(o(1/r)\)-fair
-
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors J. Cryptol. (IF 3.0) Pub Date : 2023-05-25 Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang
-
MPClan: Protocol Suite for Privacy-Conscious Computations J. Cryptol. (IF 3.0) Pub Date : 2023-05-24 Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh
-
High-Throughput Secure Three-Party Computation with an Honest Majority J. Cryptol. (IF 3.0) Pub Date : 2023-05-22 Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein
-
Must the Communication Graph of MPC Protocols be an Expander? J. Cryptol. (IF 3.0) Pub Date : 2023-05-10 Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubáček
-
Learn from Your Faults: Leakage Assessment in Fault Attacks Using Deep Learning J. Cryptol. (IF 3.0) Pub Date : 2023-05-09 Sayandeep Saha, Manaar Alam, Arnab Bag, Debdeep Mukhopadhyay, Pallab Dasgupta
-
Latin Dances Reloaded: Improved Cryptanalysis Against Salsa and ChaCha, and the Proposal of Forró J. Cryptol. (IF 3.0) Pub Date : 2023-05-01 Murilo Coutinho, Iago Passos, Juan C. Grados Vásquez, Santanu Sarkar, Fábio L. L. de Mendonça, Rafael T. de Sousa, Fábio Borges
-
I Want to Ride My BICYCL : BICYCL Implements CryptographY in CLass Groups J. Cryptol. (IF 3.0) Pub Date : 2023-04-26 Cyril Bouvier, Guilhem Castagnos, Laurent Imbert, Fabien Laguillaumie
-
Revisiting the Efficiency of Asynchronous MPC with Optimal Resilience Against General Adversaries J. Cryptol. (IF 3.0) Pub Date : 2023-04-24 Ananya Appan, Anirudh Chandramouli, Ashish Choudhury
-
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries J. Cryptol. (IF 3.0) Pub Date : 2023-04-18 Koji Chida, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Daniel Genkin, Yehuda Lindell, Ariel Nof
Protocols for secure multiparty computation enable a set of parties to compute a function of their inputs without revealing anything but the output. The security properties of the protocol must be preserved in the presence of adversarial behavior. The two classic adversary models considered are semi-honest (where the adversary follows the protocol specification but tries to learn more than allowed
-
NIZK from SNARGs J. Cryptol. (IF 3.0) Pub Date : 2023-04-08 Fuyuki Kitagawa, Takahiro Matsuda, Takashi Yamakawa
-
On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience J. Cryptol. (IF 3.0) Pub Date : 2023-03-25 Ashish Choudhury, Arpita Patra
-
Adaptively Secure MPC with Sublinear Communication Complexity J. Cryptol. (IF 3.0) Pub Date : 2023-03-22 Ran Cohen, Abhi Shelat, Daniel Wichs
-
Bootstrapping for BGV and BFV Revisited J. Cryptol. (IF 3.0) Pub Date : 2023-03-23 Robin Geelen, Frederik Vercauteren
-
An Efficient Threshold Access-Structure for RLWE-Based Multiparty Homomorphic Encryption J. Cryptol. (IF 3.0) Pub Date : 2023-03-22 Christian Mouchet, Elliott Bertrand, Jean-Pierre Hubaux
-
-
SLAP: Simpler, Improved Private Stream Aggregation from Ring Learning with Errors J. Cryptol. (IF 3.0) Pub Date : 2023-03-03 Jonathan Takeshita, Ryan Karl, Ting Gong, Taeho Jung
-
Oblivious RAM with Worst-Case Logarithmic Overhead J. Cryptol. (IF 3.0) Pub Date : 2023-02-24 Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi
-
Decentralized Multi-authority ABE for $$\textsf{NC}^1$$ from BDH J. Cryptol. (IF 3.0) Pub Date : 2023-02-24 Pratish Datta, Ilan Komargodski, Brent Waters
Decentralized multi-authority attribute-based encryption (\(\textsf{MA}\)-\(\textsf{ABE}\)) is a strengthening of standard ciphertext-policy attribute-based encryption so that there is no trusted central authority: Any party can become an authority and there is no requirement for any global coordination other than the creation of an initial set of common reference parameters. Essentially, any party
-
Rotational Differential-Linear Cryptanalysis Revisited J. Cryptol. (IF 3.0) Pub Date : 2022-12-14 Yunwen Liu, Zhongfeng Niu, Siwei Sun, Chao Li, Lei Hu
-
Minicrypt Primitives with Algebraic Structure and Applications J. Cryptol. (IF 3.0) Pub Date : 2022-12-01 Navid Alamati, Hart Montgomery, Sikhar Patranabis, Arnab Roy
-
On the Hardness of Module Learning with Errors with Short Distributions J. Cryptol. (IF 3.0) Pub Date : 2022-11-30 Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen
-
Improved Differential-Linear Attacks with Applications to ARX Ciphers J. Cryptol. (IF 3.0) Pub Date : 2022-10-12 Christof Beierle, Marek Broll, Federico Canale, Nicolas David, Antonio Flórez-Gutiérrez, Gregor Leander, María Naya-Plasencia, Yosuke Todo
-
The Inverse of $$\chi $$ and Its Applications to Rasta-Like Ciphers J. Cryptol. (IF 3.0) Pub Date : 2022-10-04 Fukang Liu, Santanu Sarkar, Willi Meier, Takanori Isobe
-
Signed (Group) Diffie–Hellman Key Exchange with Tight Security J. Cryptol. (IF 3.0) Pub Date : 2022-09-27 Jiaxin Pan, Chen Qian, Magnus Ringerud
-
Efficient Perfectly Secure Computation with Optimal Resilience J. Cryptol. (IF 3.0) Pub Date : 2022-09-27 Ittai Abraham, Gilad Asharov, Avishay Yanai
Secure computation enables n mutually distrustful parties to compute a function over their private inputs jointly. In 1988, Ben-Or, Goldwasser, and Wigderson (BGW) proved that any function can be computed with perfect security in the presence of a malicious adversary corrupting at most \(t< n/3\) parties. After more than 30 years, protocols with perfect malicious security, and round complexity proportional
-
On the (in)Security of ROS J. Cryptol. (IF 3.0) Pub Date : 2022-09-15 Fabrice Benhamouda, Tancrède Lepoint, Julian Loss, Michele Orrù, Mariana Raykova