Based on an explicit formula of the generating series for n-point psi-class intersection numbers (cf. Bertola et al. Physica D 327:30–57, 2016), we give a novel proof conjecture Delecroix in (Duke Math J 170:2633–2718, 2021) regarding large genus uniform leading asymptotics numbers. We also investigate polynomiality phenomenon genera.

In this paper, we propose a construction of fair and efficient mutual Private Set Intersection (mPSI) with linear communication and computation complexities, where the underlying group is of prime order. The main tools in our approach include: (i) ElGamal and Distributed ElGamal Cryptosystems as multiplicatively Homomorphic encryptions, (ii) Cramer-Shoup Cryptosystem as Verifiable encryption. O...

This paper presents an efficient construction of a private disjointness testing protocol that is secure against malicious provers and honest-but-curious (semi-honest) verifiers, without the use of random oracles. In a completely semi-honest setting, this construction implements a private intersection cardinality protocol. We formally define both private intersection cardinality and private disj...

This work presents an efficient and effective system allowing hospitals to share patients’ private information while ensuring that each hospital database’s medical records will not be leaked; moreover, the privacy of patients who access data also protected. We assume thread model hospital’s security is semi-honest (i.e., curious but honest), hired a trusted department administrator manage from ...

Consider the problem of maintaining a family F of dynamic sets subject to insertions, deletions, and set-intersection reporting queries: given S, S′ ∈ F , report every member of S ∩S′ in any order. We show that in the word RAM model, where w is the word size, given a cap d on the maximum size of any set, we can support set intersection queries in O( d w/ log2 w ) expected time, and updates in O...

Set constraints are inclusions between expressions denoting sets of trees. The eficiency of their satisfiabili ty test is a central issue in set-based program analysis, their main application domain. W e introduce the class of set constraints with intersection (the only operators forming the expressions are constructors and intersection) and show that i ts satisfiability problem as DEXPTIME-com...

Secure two-party computation allows two mutually distrusting parties to jointly compute an arbitrary function on their private inputs without revealing anything but the result. An interesting target for deploying secure computation protocols are mobile devices as they contain a lot of sensitive user data. However, their resource restriction makes the deployment of secure computation protocols a...

TransformeR is a domain-specific language embedded in the R programming language for writing safe variable transformations within the PSI private data sharing interface. In this document, we present the integration of TransformeR within the PSI prototype and the language’s grammar, statistical operations and type system. We also attach a list of desiderata together with guidelines for future co...