Private Over-threshold Aggregation Protocols over Distributed Databases, by Myungsun Kim and Abedelaziz Mohaisen and Jung Hee Cheon and Yongdae Kim
In this paper, we revisit the private over-threshold data aggregation problem, and formally define the problem\'s security requirements as both data and user privacy goals. To achieve both goals, and to strike a balance between efficiency and functionality, we devise a novel cryptographic construction that comes in two schemes; a fully decentralized construction and its practical but semi-decentralized variant. Both schemes are provably secure in the semi-honest model.
We analyze the computational and communication complexities of our construction, and show that it is much more efficient than the existing protocols in the literature.
Finally, we show that our basic protocol is efficiently transformed into a stronger protocol secure in the presence of malicious adversaries, together with performance and security analysis.
The Parallel-Cut Meet-In-The-Middle Attack, by Ivica Nikolic, Lei Wang and Shuang Wu
We propose a new type of meet-in-the-middle attack that splits the
cryptographic primitive in parallel to the execution of the operations. The result of the division are two primitives that have smaller input sizes and thus require lower attack complexities.
However, the division is not completely independent and the sub-primitives depend (output of one is the input for the other) mutually on a certain number of bits. When the number of such bits is relatively small, we show a technique based on three classical meet-in-the-middle attacks that can recover the secret key of the cipher faster than an exhaustive search. We apply our findings to the lightweight block cipher KLEIN and show attacks on 10/11/13 rounds of KLEIN-64/-80/-96.
Our approach requires only one or two pairs of known plaintexts and always recovers the secret key.
On the Limits of Provable Anonymity, by Nethanel Gelernter and Amir Herzberg
We study provably secure anonymity, focusing on ultimate
anonymity - strongest-possible anonymity requirements and
adversaries. We begin with rigorous definition of anonymity
against wide range of computationally-bounded attackers,
including eavesdroppers, malicious peers, malicious destina-tions, and their combinations. Following the work of Hevia and Micciancio , our definition is generic, and captures dierent notions of anonymity (e.g., unobservability and sender anonymity).
We then study the feasibility of ultimate anonymity. We
show there is a protocol satisfying this requirement, but with
absurd (although polynomial) inefficiency and overhead. We
show that such inefficiency and overhead is unavoidable for
`ultimate anonymity\'. We then present a slightly-relaxed
requirement and present feasible protocols for it.
On a Relation between the Ate Pairing and the Weil Pairing for Supersingular Elliptic Curves, by Takakazu Satoh
The hyperelliptic curve Ate pairing provides an efficient way to compute a
bilinear pairing on the Jacobian variety of a hyperelliptic curve.
We prove that, for supersingular elliptic curves with embedding degree
two, square of the Ate pairing is nothing but the Weil pairing.
Using the formula, we develop an X-coordinate only pairing inversion method.
However, the algorithm is still infeasible for cryptographic size problems.
Gossip Latin Square and The Meet-All Gossipers Problem, by Nethanel Gelernter and Amir Herzberg
Given a network of n = 2^k
gossipers, we want to schedule a cyclic calendar
of meetings between all of them, such that: (1) each gossiper communicates
(gossips) only once a day, with one other gossiper, (2) in every (n 1) consecutive
days, each gossiper meets all other gossipers, and (3) every gossip, initiated by
any gossiper, will reach all gossipers within k = log(n) days.
In this paper we study the above stated meet-all gossipers problem, by den-ing and constructing the Gossip Latin Square (GLS), a combinatorial structure
which solves the problem.
Efficient Unobservable Anonymous Reporting against Strong Adversaries, by Nethanel Gelernter and Amir Herzberg
We present DURP, a decentralized protocol for
unobservable, anonymous reporting to an untrusted destination,
with low latency and overhead. DURP provably ensures strong
anonymity properties, as required for some applications (and not
provided by existing systems and practical designs, e.g., Tor),
Provable unobservability against global eavesdropper and
Provable source anonymity against a malicious destination.
Probable-innocence against a malicious destination which is
also a global eavesdropper.
DURP design is a modular combination of two modules: a
queuing module, ensuring fixed rates for certain events, together
with an anonymization module, which can use either Onion-Routing (DURP^OR) or Crowds (DURP^Crowds). We present anal-ysis, backed by simulation results, of the network properties and
performance of DURP, and show it has reasonable overhead. We
also use the analysis results to create an optimized version of
Accelerating Scalar Conversion for Koblitz Curve Cryptoprocessors on Hardware Platforms, by Sujoy Sinha Roy and Junfeng Fan and Ingrid Verbauwhede
Koblitz curves are a class of computationally efficient elliptic curves where scalar multiplications can be accelerated using $\\tau$NAF representations of scalars. However conversion from an integer scalar to a short $\\tau$NAF is costly and thus restricts speed. In this paper we present acceleration techniques for the recently proposed scalar conversion hardware based on division by $\\tau^2$. Acceleration is achieved in two steps. First we perform computational optimizations to reduce the number of long subtraction operations during the conversion of scalar. This helps in reducing the number of integer adder/subtracter circuits from the critical paths of the conversion architecture. In the second step, we perform pipelining in the conversion architecture in such a way that the pipeline stages are always utilized. Due to bubble free nature of the pipelining, clock cycle requirement of the conversion architecture remains same, while operating frequency increases drastically.
We present detailed experimental results to support our claims made in this paper.
Inter-FSP Funds Transfer Protocol, by Amir Herzberg and Shay Nachmani
We present the first decentralized secure funds transfer protocol with multiple participants. The protocol ensures that a participant can only lose money, if a peer it trusted is corrupted. Furthermore, the loss is
bounded by the credit allocated to this partner. The protocol supports expiration times for payment orders, and realistic network queuing delay.We achieve this using model and techniques from the Quality of Service area to guarantee delays and avoid payment order expiration. We present rigorous security proof.