Lower Bound for One Round Protocols
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
... Cryptographic Protocols Our lower bound on the round complexity of statistical commitment schemes implies similar lower bounds for several other cryptographic ...new lower bounds ...
39
Pairing-Based One-Round Tripartite Key Agreement Protocols
... agreement protocols used to prove the security, ...in one security model, but heuristically evaluate the security by attempting a list of ...pairing-based one-round tripartite protocols ...
11
New Techniques for SPHFs and Efficient One-Round PAKE Protocols
... their one-round PAKE, Katz and Vaikuntanathan did not manage to construct such a KV-SPHF for an efficient IND-CCA encryption ...is one-round ...
26
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model
... with one-round key-agreement protocols, called Merkle’s Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a random permutation oracle n ...quadratic ...
7
Constant Round Non-Malleable Protocols using One Way Functions
... prove one-many non-malleability of hbC, bRi, we construct a p-compatible distribution by simply running the extractor E one by one on each session on the ...
28
A sharp lower bound
... (n + 1 + 2(l − s))/3 and these bounds are sharp. We constructively characterize the trees achieving the lower bounds. 1 Introduction For various safeguard applications that use graphical models of facilities or ...
14
Is There an Oblivious RAM Lower Bound?
... Bins? One can orthogonally relax the balls and bins model ...[GO96] lower bound extend to a setting of Balls and Bins with Linear Encoding, where the CPU may generate balls of a different “color” ...
29
Mind the Gap: Modular Machine-checked Proofs of One-Round Key Exchange Protocols
... Although pRHL captures common patterns of reasoning in cryptographic proofs, there is an impedance mismatch between cryptographic practice and proofs built using pRHL; in particular, pRHL lacks mechanisms to instantiate ...
30
Why Is the Government Spending Multiplier Larger at the Zero Lower Bound? Not (Only) Because of the Zero Lower Bound
... I assume that the shock is big enough for the economy to stay one period at the Zero Lower Bound. I also assume that the government spending shock is small enough so that it does not influence the ...
30
Yes, There is an Oblivious RAM Lower Bound!
... way, one basically shows that every leaf must make a memory access for every ancestor in T , resulting in an Ω(lg M ) lower ...each one, change the distribution over operations such that the read ...
21
Lower Bound Techniques for Data Structures
... Our first paper was, to some extent, a lucky accident. After a visit to my uncle in Philadelphia, I was stuck on a long bus ride back to MIT, when Alex called to say that he had some intuition about why (1 + ...
139
A bound on the capacity of backoff and acknowledgement based protocols
... a send value whih is at least as great as the number of sends from the buket. F or suh onstrained genies, we an improve the bound of Corollary 16. F or the range of arrival rates we onsider, an exellent strategy ...
22
A bound on the capacity of backoff and acknowledgement-based protocols
... Much work has gone into determining upper bounds on the capacity that can be achieved by a full-sensing protocol. The current best result is due to Tsybakov and Likhanov [24] who have shown that no protocol can achieve ...
29
On Expected Constant-Round Protocols for Byzantine Agreement
... 1 Other “abstractions” include the assumptions of private and/or authenticated channels. For computationally- bounded adversaries these can be realized without affecting the round complexity using public-key ...
27
Two 1-Round Protocols for Delegation of Computation
... servers, one honest and one malicious (but the referee/client does not know which is ...our protocols to more than two ...a lower layer (closer to the circuit’s input layer), we call this an ...
22
An average case lower bound against ACC0
... worst-case lower bound for ZPTIME[2 O(n) ]/1 in Theorem 3 can be strengthened to an average-case lower bound using the same technique as in the proof of Theorem ...the lower ...
15
Uncertainty and the Zero Lower Bound: A Theoretical Analysis
... of the equilibria involves in‡ation on target and a positive nominal interest rate. The other involves de‡ation and a zero nominal interest rate. 1 In this paper, I discuss the set of rational expectations equilibria in ...
27
An entropy lower bound for non malleable extractors
... The notion of non-malleable extractors is strongly motivated by applications to privacy ampli- fication protocols in presence of an active adversary. This problem considers a setting in which two ∗ Centre for ...
16
A tight lower bound for planar steiner orientation
... Note that the orientation of G which orients all dotted edges leftwards, i.e., LB ← TR, contains each of the vertical canonical paths defined above. Observe that both the horizontal canonical paths and vertical canonical ...
17
Inflation During and After the Zero Lower. Bound
... the one hand, and Japan on the other is the remarkable stability of long-run inflation expectations in the former two economies despite fairly large swings in actual ...
64