Pages that link to "Item:Q2790061"
From MaRDI portal
The following pages link to Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ (Q2790061):
Displayed 26 items.
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- Practical fully secure unrestricted inner product functional encryption modulo \(p\) (Q1710625) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- Bandwidth-efficient threshold EC-DSA (Q2055695) (← links)
- Compact zero-knowledge proofs for threshold ECDSA with trustless setup (Q2061931) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security (Q2098172) (← links)
- A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency (Q2124234) (← links)
- One-more unforgeability of blind ECDSA (Q2148761) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ (Q2790061) (← links)
- An applications of signed quadratic residues in public key cryptography (Q4644792) (← links)
- Round-Efficient Anonymous Password-Authenticated Key Exchange Protocol in the Standard Model (Q5040423) (← links)
- New Ideas to Build Noise-Free Homomorphic Cryptosystems (Q5048988) (← links)
- Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups (Q6041298) (← links)
- Zero-knowledge arguments for subverted RSA groups (Q6088994) (← links)
- Multi-signatures for ECDSA and its applications in blockchain (Q6108787) (← links)
- On Constructing Pairing-Free Identity-Based Encryptions (Q6108845) (← links)
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups (Q6110377) (← links)
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) (Q6132407) (← links)
- MyOPE: malicious security for oblivious polynomial evaluation (Q6134853) (← links)
- Towards practical topology-hiding computation (Q6135413) (← links)
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials (Q6157516) (← links)
- An algebraic framework for silent preprocessing with trustless setup and active security (Q6166960) (← links)
- The special case of cyclotomic fields in quantum algorithms for unit groups (Q6186351) (← links)
- Secure multiparty computation from threshold encryption based on class groups (Q6186606) (← links)