Search
Search Results
-
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...
-
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...
-
Online Matching with Stochastic Rewards: Advanced Analyses Using Configuration Linear Programs
Mehta and Panigrahi (2012) proposed Online Matching with Stochastic Rewards, which generalizes the Online Bipartite Matching problem of Karp,...
-
Reallocation Mechanisms Under Distributional Constraints in the Full Preference Domain
We study the problem of reallocating indivisible goods among a set of agents in one-sided matching market, where the feasible set for each good is...
-
Experimental Results for Cryptcodes Based on Quasigroups for Transmission Through a BSC
In this chapter, we present experimental results for cryptcodes based on quasigroups for transmission through a binary-symmetric channel (BSC). In...
-
Wie man effektiver faktorisiert
In Kap. 11 haben wir mehrere Faktorisierungsmethoden beschrieben. Jede davon wird bei einigen Ganzzahlen erfolgreich sein, aber keine davon ist eine...
-
Elliptische Kurven
Elliptische Kurven sind eines der eleganteren Objekte in der Algebra. Ein Hintergrundwissen über die zugrunde liegende Arithmetik von Kurven ist für...
-
Elliptische Kurven Kryptographie
Das erste vorgeschlagene asymmetrische Verschlüsselungsschema war das von Rivest, Shamir und Adleman, das die Exponentiation in der Gruppe der...
-
Gitterbasierte Kryptographie und NTRU
Mit der Veröffentlichung von Peter Shors bahnbrechendem Artikel, dass das Faktorisieren und diskrete Logarithmenberechnungen auf einem...
-
Optimally-Fair Multi-party Exchange Without Trusted Parties
We present a multi-party exchange protocol that achieves optimal partial fairness even in the presence of a dishonest majority. We demonstrate how...
-
Deniable Cryptosystems: Simpler Constructions and Achieving Leakage Resilience
Deniable encryption (Canetti et al. in CRYPTO ’97) is an intriguing primitive, which provides security guarantee against coercion by allowing a...
-
Covercrypt: An Efficient Early-Abort KEM for Hidden Access Policies with Traceability from the DDH and LWE
Attribute-Based Encryption (ABE) is a very attractive primitive to limit access according to specific rights. While very powerful instantiations have...
-
Consolidation of Ground Truth Sets for Weakness Detection in Smart Contracts
Smart contracts are small programs on the blockchain that often handle valuable assets. Vulnerabilities in smart contracts can be costly, as time has...
-
Short Squeeze in DeFi Lending Market: Decentralization in Jeopardy?
Anxiety levels in the Aave community spiked in November 2022 as Avi Eisenberg performed an attack on Aave. Eisenberg attempted to short the CRV token...
-
Overstatement-Net-Equivalent Risk-Limiting Audit: ONEAudit
A procedure is a risk-limiting audit (RLA) with risk limit \(\alpha \)...
-
Uniswap Liquidity Provision: An Online Learning Approach
Uniswap v3 is a decentralized exchange (DEX) that allows liquidity providers to allocate funds more efficiently by specifying an active price...
-
The Principal–Agent Problem in Liquid Staking
Proof-of-stake systems require stakers to lock up their funds in order to participate in consensus validation. This leads to capital inefficiency, as...
-
The Good, the Bad and the Submodular: Fairly Allocating Mixed Manna Under Order-Neutral Submodular Preferences
We study the problem of fairly allocating indivisible goods (positively valued items) and chores (negatively valued items) among agents with...
-
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...
-
One Quarter Each (on Average) Ensures Proportionality
We consider the problem of fair allocation of m indivisible items to a group of n agents with subsidy (money). Our work mainly focuses on the...