The following pages link to (Q2724587):
Displaying 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Rate-limited secure function evaluation (Q329720) (← links)
- Paillier-based publicly verifiable (non-interactive) secret sharing (Q398963) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- A communication-efficient private matching scheme in client-server model (Q726566) (← links)
- Preserving worker privacy in crowdsourcing (Q736504) (← links)
- Privacy-preserving algorithms for distributed mining of frequent itemsets (Q867633) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Filling the gap between voters and cryptography in e-voting (Q1028368) (← links)
- Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system (Q1647557) (← links)
- All-but-many encryption (Q1747665) (← links)
- Group homomorphic encryption: characterizations, impossibility results, and applications (Q1943979) (← links)
- More constructions of lossy and correlation-secure trapdoor functions (Q1946593) (← links)
- Oblivious DFA evaluation on joint input and its applications (Q2023228) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← links)
- Incompressible encodings (Q2096497) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Two-sided malicious security for private intersection-sum with cardinality (Q2102051) (← links)
- Counterexamples to new circular security assumptions underlying iO (Q2128580) (← links)
- Large message homomorphic secret sharing from DCR and applications (Q2129016) (← links)
- Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems (Q2160700) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← links)
- A generic construction of tightly secure signatures in the multi-user setting (Q2419110) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences (Q2490987) (← links)
- Security analysis and improvement of a double-trapdoor encryption scheme (Q2572322) (← links)
- A research on new public-key encryption schemes (Q2572324) (← links)
- Privacy-preserving Krawtchouk moment feature extraction over encrypted image data (Q2666794) (← links)
- Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)
- Laconic private set intersection and applications (Q2697887) (← links)
- Communication Optimal Tardos-Based Asymmetric Fingerprinting (Q2790060) (← links)
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ (Q2790061) (← links)
- Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems (Q2794490) (← links)
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM (Q2799094) (← links)
- Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security (Q2822671) (← links)
- Better Preprocessing for Secure Multiparty Computation (Q2822679) (← links)
- New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications (Q2890001) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions (Q2953781) (← links)
- Quadratic Error Minimization in a Distributed Environment with Privacy Preserving (Q3003497) (← links)
- Benaloh’s Dense Probabilistic Encryption Revisited (Q3011926) (← links)
- Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy (Q3092348) (← links)
