Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
From MaRDI portal
Recommendations
- Public-key cryptosystem based on n-th residuosity of n=p^2q
- A PUBLIC KEY CRYPTOSYSTEM BASED ON COMPLEMENTING SETS
- On public-key cryptosystems based on combinatorial group theory
- A public-key threshold cryptosystem based on residue rings
- scientific article; zbMATH DE number 5973815
- Public-key cryptosystems based on cubic finite field extensions
- Multivariate public key cryptosystems
- Multivariate public key cryptosystems
- New public key cryptosystems from combinatorial group theory
- Public-Key Cryptosystems with Primitive Power Roots of Unity
Cited in
(only showing first 100 items - show all)- On RSA moduli with almost half of the bits prescribed
- Semantic security for the McEliece cryptosystem without random oracles
- Hybrid commitments and their applications to zero-knowledge proof systems
- Filling the gap between voters and cryptography in e-voting
- Distributed anonymous data perturbation method for privacy-preserving data mining
- Some basics on privacy techniques, anonymization and their big data challenges
- Information security protocol based system identification with binary-valued observations
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- Privacy-preserving distributed mining of association rules using elliptic-curve cryptosystem and Shamir's secret sharing scheme
- Privacy-preserving inverse distance weighted interpolation
- Regular lossy functions and their applications in leakage-resilient cryptography
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- Reproducible circularly secure bit encryption: applications and realizations
- Privacy-preserving outsourcing of image feature extraction in cloud computing
- Decentralized multi-client functional encryption for inner product
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Homomorphic secret sharing for low degree polynomials
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- On the tightness of forward-secure signature reductions
- Privacy preserving distributed optimization using homomorphic encryption
- Parallel algorithms for modular multi-exponentiation
- Trusted computing with addition machines. II
- All-but-many encryption
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- On RSA moduli with half of the bits prescribed
- Group homomorphic encryption: characterizations, impossibility results, and applications
- More constructions of lossy and correlation-secure trapdoor functions
- Oblivious DFA evaluation on joint input and its applications
- New assumptions and efficient cryptosystems from the \(e\)-th power residue symbol
- Candidate iO from homomorphic encryption schemes
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Boosting verifiable computation on encrypted data
- Aggregatable distributed key generation
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- LPPRS: new location privacy preserving schemes based on ring signature over mobile social networks
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Multiparty cardinality testing for threshold private intersection
- A geometric approach to homomorphic secret sharing
- BETA: biometric-enabled threshold authentication
- Multi-party threshold private set intersection with sublinear communication
- Sampled-data-based fault-tolerant consensus control for multi-agent systems: a data privacy preserving scheme
- Incompressible encodings
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- PSI-stats: private set intersection protocols supporting secure statistical functions
- Influence maximization in social networks with privacy protection
- CECMLP: new cipher-based evaluating collaborative multi-layer perceptron scheme in federated learning
- Blind polynomial evaluation and data trading
- Counterexamples to new circular security assumptions underlying iO
- Large message homomorphic secret sharing from DCR and applications
- Succinct non-interactive arguments via linear interactive proofs
- White-box ECDSA: challenges and existing solutions
- Generic plaintext equality and inequality proofs
- Practical witness-key-agreement for blockchain-based dark pools financial trading
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
- One-more unforgeability of blind ECDSA
- Attacks on a privacy-preserving publish-subscribe system and a ride-hailing service
- When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
- Encrypted SQL arithmetic functions processing for secure cloud database
- Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems
- Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data
- Dynamic searchable symmetric encryption schemes supporting range queries with forward (and backward) security
- Private computation of polynomials over networks
- Secure multiparty computation with sublinear preprocessing
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Single-server private information retrieval with sublinear amortized time
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Compressible FHE with applications to PIR
- Oblivious sampling with applications to two-party k-means clustering
- Hiding clinical information in medical images: an enhanced encrypted reversible data hiding algorithm grounded on hierarchical absolute moment block truncation coding
- Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack
- Differentially private naive Bayes learning over multiple data sources
- Privacy-preserving ridge regression on distributed data
- Outsourcing scalar products and matrix products on privacy-protected unencrypted data stored in untrusted clouds
- Homomorphic extensions of CRT-based secret sharing
- Expressive query over outsourced encrypted data
- Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers
- Secure multi-label data classification in cloud by additionally homomorphic encryption
- A secure control mechanism for network environments
- Homomorphically encrypted k-means on cloud-hosted servers with low client-side load
- PC-SyncBB: a privacy preserving collusion secure DCOP algorithm
- Secure and privacy preserving consensus for second-order systems based on Paillier encryption
- Security against covert adversaries: Efficient protocols for realistic adversaries
- A compressive sensing based privacy preserving outsourcing of image storage and identity authentication service in cloud
- An efficient privacy-preserving compressive data gathering scheme in WSNs
- Encrypted data processing with homomorphic re-encryption
- Leakage-resilient biometric-based remote user authentication with fuzzy extractors
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
- Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs
- Solving discrete logarithm problems faster with the aid of pre-computation
- An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials
- The Rabin cryptosystem revisited
- An efficient probabilistic public-key cryptosystem over quadratic fields quotients
- Threshold cryptography based on Asmuth-Bloom secret sharing
- Prêt à voter with Paillier encryption
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption
This page was built for publication: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250764)
