Pages that link to "Item:Q2175948"
From MaRDI portal
The following pages link to Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948):
Displaying 20 items.
- Security definitions on time-lock puzzles (Q831622) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Delay encryption (Q2056688) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Efficient homomorphic conversion between (ring) LWE ciphertexts (Q2117044) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- Multi-instance publicly verifiable time-lock puzzle and its applications (Q2147261) (← links)
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) (Q2148748) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- Batch-OT with optimal rate (Q2170043) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← links)
- Multi-client oblivious RAM with poly-logarithmic communication (Q2692380) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- The round complexity of quantum zero-knowledge (Q2695629) (← links)
- Rate-1 quantum fully homomorphic encryption (Q2695630) (← links)
- Succinct LWE sampling, random polynomials, and obfuscation (Q2697860) (← links)
- Algebraic restriction codes and their applications (Q6066762) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6204164) (← links)
