Secure function extensions to additively homomorphic cryptosystems
From MaRDI portal
Recommendations
Cites work
- A minimal model for secure computation (extended abstract)
- Better spaced seeds using quadratic residues
- Efficient and Secure Comparison for On-Line Auctions
- Fast secure comparison for medium-sized integers and its application in binarized neural networks
- Homomorphic encryption and secure comparison
- scientific article; zbMATH DE number 1261806 (Why is no real title available?)
- scientific article; zbMATH DE number 1303131 (Why is no real title available?)
- scientific article; zbMATH DE number 3221502 (Why is no real title available?)
- scientific article; zbMATH DE number 3342909 (Why is no real title available?)
- scientific article; zbMATH DE number 4187706 (Why is no real title available?)
- On finite pseudorandom binary sequences and their applications in cryptography
- On pseudorandomness in families of sequences derived from the Legendre symbol
- On runs of consecutive quadratic residues and quadratic nonresidues
- On the Distribution of Quadratic Residues (mod p )
- On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- The distribution of quadratic residues and non‐residues
This page was built for publication: Secure function extensions to additively homomorphic cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620058)