Related papers: Oblivious Transfer using Elliptic Curves
We discuss the use of elliptic curves in cryptography on high-dimensional surfaces. In particular, instead of a Diffie-Hellman key exchange protocol written in the form of a bi-dimensional row, where the elements are made up with 256 bits,…
In this paper we present an algebraic dimension-oblivious two-level domain decomposition solver for discretizations of elliptic partial differential equations. The proposed parallel solver is based on a space-filling curve partitioning…
Secure multiparty computation enables collaborative computations across multiple users while preserving individual privacy, which has a wide range of applications in finance, machine learning and healthcare. Secure multiparty computation…
Proposed Bell pair swapping protocols, an essential component of the Quantum Internet, are planned-path: specific, structured, routing paths are reserved prior to the execution of the swapping process. This makes sense when one assumes the…
Oblivious routing has a long history in both the theory and practice of networking. In this work we initiate the formal study of oblivious routing in the context of reconfigurable networks, a new architecture that has recently come to the…
Let $P$ be an arbitrary point on an elliptic curve over the complex numbers of the form $y^2=x^3+a_4\,x+a_6$ or of the form $y^2=x^3+a_2\,x^2+a_4\,x$. We provide explicit formulae to compute the points $P/2$, i.e., the points $Q$ such that…
In this talk we discuss Feynman integrals which are related to elliptic curves. We show with the help of an explicit example that in the set of master integrals more than one elliptic curve may occur. The technique of maximal cuts is a…
This paper studies the task of two-sources randomness extractors for elliptic curves defined over finite fields $K$, where $K$ can be a prime or a binary field. In fact, we introduce new constructions of functions over elliptic curves which…
An elliptic curve-based signcryption scheme is introduced in this paper that effectively combines the functionalities of digital signature and encryption, and decreases the computational costs and communication overheads in comparison with…
We present a device independently secure quantum scheme for p-threshold all-or-nothing oblivious transfer. Novelty of the scheme is that, its security does not depend -- unlike the usual case -- on any quantum bit commitment protocol,…
We present a simple and efficient algorithm to compute the sum of the algebraic conjugates of a point on an elliptic curve.
Elliptic curves are planar curves which can be used to define an abelian group. The efficient computation of discrete logarithms over this group is a longstanding problem relevant to cryptography. It may be possible to efficiently compute…
Databases play a pivotal role in the contemporary World Wide Web and the world of cloud computing. Unfortunately, numerous privacy violations have recently garnered attention in the news. To enhance database privacy, we consider Oblivious…
We study effective versions of unlikely intersections of images of torsion points of elliptic curves on the projective line.
Due to the commonly known impossibility results, information theoretic security is considered impossible for oblivious transfer (OT) in both the classical and the quantum world. In this paper, we proposed a weak version of the…
We present a protocol for transfer of an unknown quantum state. The protocol is based on a two-mode cavity interacting dispersively in a sequential manner with three-level atoms in $\Lambda$ configuration. We propose a scheme for quantum…
We consider an application involving a financial quadratic portfolio of options, when the joint underlying log-returns changes with multivariate elliptic distribution. This motivates the needs for methods for the approximation of multiple…
We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for…
Improved algorithms for computing (partial and full) exterior algebraic shifts of hypergraphs and simplicial complexes are presented. The main benefit is in positive characteristic. Experiments with an implementation in OSCAR with various…
This article deals with quantitative error analysis resulting from ellipsometric data obtained from measurement on curved surfaces including the influence of non-collimated beams. Numerical model based on the combination of geometrical and…