Search
Search Results
-
On the Correlation Complexity of MPC with Cheater Identification
Composable protocols for Multi-Party Computation that provide security with Identifiable Abort against a dishonest majority require some form of...
-
Dynamic Security Aspects of Onion Routing
An anonymous communication network (ACN) is designed to protect the identities of two parties communicating through it, even if an adversary controls...
-
Coset Leaders of the First Order Reed-Muller Codes in the Classes of Niho Functions and Threshold Functions
The notion of coset leader has applications in coding theory and cryptography. It has been studied in several papers. In this paper, we extend a...
-
Rectangle Attacks on Reduced Versions of the FBC Block Cipher
The FBC block cipher is an award-winning algorithm of the recent Cryptographic Algorithm Design Competition in China, which has three versions:...
-
zk-SNARKs from Codes with Rank Metrics
Succinct non-interactive zero-knowledge arguments of knowledge (zk-SNARKs) are a type of non-interactive proof system enabling efficient...
-
Feistel Ciphers Based on a Single Primitive
We consider Feistel ciphers instantiated with tweakable block ciphers (TBCs) and ideal ciphers (ICs). The indistinguishability security of the...
-
Spatial Shrinkage Prior: A Probabilistic Approach to Model for Categorical Variables with Many Levels
One of the most commonly used methods to prevent overfitting and select relevant variables in regression models with many predictors is the penalized...
-
The Importance of Knowing the Arrival Order in Combinatorial Bayesian Settings
We study the measure of order-competitive ratio introduced by Ezra et al. [16] for online algorithms in Bayesian combinatorial settings. In our...
-
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions
We consider fractional hedonic games, a natural and succinct subclass of hedonic games able to model many real-world settings in which agents have to...
-
Online Nash Welfare Maximization Without Predictions
The maximization of Nash welfare, which equals the geometric mean of agents’ utilities, is widely studied because it balances efficiency and fairness...
-
Equilibrium Analysis of Customer Attraction Games
We introduce a game model called “customer attraction game” to demonstrate the competition among online content providers. In this model, customers...
-
Target-Oriented Regret Minimization for Satisficing Monopolists
We study a robust monopoly pricing problem where a seller aspires to sell an item to a buyer. We assume that the seller, unaware of the buyer’s...
-
The Multi-user Security of MACs via Universal Hashing in the Ideal Cipher Model
The security of block-cipher-based hash-then-encrypt-type message authentication codes (MACs) has been proven with universal hash functions. Thus,...
-
Improved Meet-in-the-Middle Attacks on Nine Rounds of the AES-192 Block Cipher
In the single-key attack scenario, meet-in-the-middle (MitM) attack method has led to the best currently published cryptanalytic results on the AES...
-
TFHE Public-Key Encryption Revisited
Fully homomorphic encryption allows directly processing encrypted data without having to decrypt it. The result of the computation is encrypted,...
-
SoK: Parameterization of Fault Adversary Models Connecting Theory and Practice
Since the first fault attack by Boneh et al. in 1997, various physical fault injection mechanisms have been explored to induce errors in electronic...
-
Towards Compact Identity-Based Encryption on Ideal Lattices
Basic encryption and signature on lattices have comparable efficiency to their classical counterparts in terms of speed and key size. However,...
-
Cutting the GRASS: Threshold GRoup Action Signature Schemes
Group actions are fundamental mathematical tools, with a long history of use in cryptography. Indeed, the action of finite groups at the basis of the...
-
Differential Privacy for Free? Harnessing the Noise in Approximate Homomorphic Encryption
Homomorphic Encryption (HE) is a type of cryptography that allows computing on encrypted data, enabling computation on sensitive data to be...
-
Learning Markov Chain Models from Sequential Data Under Local Differential Privacy
Markov chain models are frequently used in the analysis and modeling of sequential data such as location traces, time series, natural language, and...