Search
Search Results
-
Randomized Functions with High Round Complexity
Consider two-party secure function evaluation against an honest-but-curious adversary in the information-theoretic plain model. We study the round...
-
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation
Two of the most sought-after properties of multi-party computation (MPC) protocols are fairness and guaranteed output delivery (GOD), the latter also...
-
CCA security for contracting (quasi-)Feistel constructions with tight round complexity
Feistel constructions using contracting round functions were introduced in 1990s and generalized by Yun et al. (Des Codes Cryptogr 58(1):45–72, 2011)...
-
Yoyo attack on 4-round Lai-Massey scheme with secret round functions
In this study, we present the first yoyo attack to recover the secret round function of the 4-round Lai-Massey scheme with an affine orthomorphism....
-
On the Round Complexity of Randomized Byzantine Agreement
We prove lower bounds on the round complexity of randomized Byzantine agreement (BA) protocols, bounding the halting probability of such protocols...
-
Expected linear round synchronization: the missing link for linear Byzantine SMR
State Machine Replication (SMR) solutions often divide time into rounds, with a designated leader driving decisions in each round. Progress is...
-
Improved attacks against reduced-round Whirlwind
The Whirlwind hash function was proposed by Barreto et al. (Des Codes Cryptogr 56(2–3):141–162, 2010,
https://doi.org/10.1007/s10623-010-9391-y ...
-
On the Exact Round Complexity of Secure Three-Party Computation
We settle the exact round complexity of three-party computation (3PC) in honest-majority setting, for a range of security notions such as selective...
-
On the Round Complexity of Fully Secure Solitary MPC with Honest Majority
We study the problem of secure multiparty computation for functionalities where only one party receives the output, to which we refer as solitary...
-
Adaptively Secure MPC with Sublinear Communication Complexity
A central challenge in the study of MPC is to balance between security guarantees, hardness assumptions, and resources required for the protocol. In...
-
Partial Sums Meet FFT: Improved Attack on 6-Round AES
The partial sums cryptanalytic technique was introduced in 2000 by Ferguson et al., who used it to break 6-round AES with time complexity of...
-
Full-round impossible differential attack on shadow block cipher
Lightweight block ciphers are the essential encryption algorithm for devices with limited resources. Its goal is to ensure the security of data...
-
Cube Attacks on Round-Reduced Grain-128AEAD
Lightweight cryptography aims to design secure and efficient cryptographic algorithms for resource-constrained devices. Traditional cryptographic...
-
Preimage attacks on reduced-round Ascon-Xof
Ascon , a family of algorithms that supports authenticated encryption and hashing, has been selected as the new standard for lightweight cryptography...
-
Zero-correlation linear attack on reduced-round SKINNY
At ToSC 2019, Ankele et al. proposed a novel idea for constructing zero-correlation linear distinguishers in a related-tweakey model. This paper...
-
Improved key-recovery attacks on reduced-round WEM-8
Proposed in CT-RSA’2017, WEM is a family of white-box block ciphers based on the Even-Mansour structure and AES. Due to its elegant structure and...
-
The Time Complexity of Consensus Under Oblivious Message Adversaries
We study the problem of solving consensus in synchronous directed dynamic networks, in which communication is controlled by an oblivious message...
-
Practical Single-Round Secure Wildcard Pattern Matching
Secure pattern matching allows a client who holds a substring (pattern) to find all the substring’s locations appearing in the long string (text)...
-
Differential Cryptanalysis of Round-Reduced SPEEDY Family
SPEEDY is a family of ultra low latency block ciphers proposed at TCHES 2021 by Leander et al.. The standard version, SPEEDY-6-192 offers 128-bit...
-
Square Attacks on Reduced-Round FEA-1 and FEA-2
FEA-1 and FEA-2 are the South Korean Format-Preserving Encryption (FPE) standards. In this paper, we discuss the security of FEA-1 and FEA-2 against...