Fast secure computations on shared polynomials and applications to private set operations
From MaRDI portal
Cites work
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
- An algebraic approach to maliciously secure private set intersection
- An Unconditionally Secure Protocol for Multi-Party Set Intersection
- Efficient circuit-based PSI with linear communication
- Efficient Disjointness Tests for Private Datasets
- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
- Encryption switching protocols
- Financial Cryptography and Data Security
- General secure multi-party computation from any linear secret-sharing scheme
- How to share a secret
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 1842488 (Why is no real title available?)
- Joint encryption and message-efficient secure computation
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Modern computer algebra
- Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
- Privacy-Preserving Set Operations
- Public Key Cryptography - PKC 2006
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Scalable multi-party private set-intersection
- Secure Linear Algebra Using Linearly Recurrent Sequences
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- The communication complexity of threshold private set intersection
- Theory of Cryptography
- Theory of Cryptography
- Threshold private set intersection with better communication complexity
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
This page was built for publication: Fast secure computations on shared polynomials and applications to private set operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864446)
