The following pages link to (Q2724587):
Displayed 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)
- 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)
- 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)
- General Construction of Chameleon All-But-One Trapdoor Functions (Q3092363) (← links)
- On Constructing Homomorphic Encryption Schemes from Coding Theory (Q3104683) (← links)
- Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts (Q3181025) (← links)
- Efficiency Limitations for Σ-Protocols for Group Homomorphisms (Q3408215) (← links)
- Public-Key Cryptosystems with Primitive Power Roots of Unity (Q3511155) (← links)
- Fully-Simulatable Oblivious Set Transfer (Q3511158) (← links)
- Asynchronous Multi-Party Computation with Quadratic Communication (Q3519524) (← links)
- Two Generic Constructions of Probabilistic Cryptosystems and Their Applications (Q3540038) (← links)
- An RSA-Based (t,n) Threshold Proxy Signature Scheme without Any Trusted Combiner (Q3540151) (← links)
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings (Q3540161) (← links)
- Efficient Binary Conversion for Paillier Encrypted Values (Q3593115) (← links)
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles (Q3600228) (← links)
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries (Q3600327) (← links)
- Communication-Efficient Private Protocols for Longest Common Subsequence (Q3623051) (← links)
- Equivocal Blind Signatures and Adaptive UC-Security (Q5445514) (← links)
- SuperTrust – A Secure and Efficient Framework for Handling Trust in Super Peer Networks (Q5445775) (← links)
- Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library (Q5505478) (← links)
- A Tamper-Evident Voting Machine Resistant to Covert Channels (Q5505481) (← links)