The following pages link to (Q2724587):
Displayed 18 items.
- CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions (Q5738751) (← links)
- Circuit-Private Multi-key FHE (Q5738758) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- Optimally Sound Sigma Protocols Under DCRA (Q5854433) (← links)
- A Simpler Rate-Optimal CPIR Protocol (Q5854446) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Fast secure two-party ECDSA signing (Q5918379) (← links)
- New ways to garble arithmetic circuits (Q6061350) (← links)
- Transparent batchable time-lock puzzles and applications to Byzantine consensus (Q6070776) (← links)
- Zero-knowledge arguments for subverted RSA groups (Q6088994) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- How to verifiably encrypt many bits for an election? (Q6109453) (← links)
- Rate-1 incompressible encryption from standard assumptions (Q6114264) (← links)
- Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext (Q6123051) (← links)
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) (Q6132407) (← links)
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions (Q6134825) (← links)
- An algebraic framework for silent preprocessing with trustless setup and active security (Q6166960) (← links)
- Zero-knowledge range arguments for signed fractional numbers from lattices (Q6173119) (← links)