Pages that link to "Item:Q2304914"
From MaRDI portal
The following pages link to Trapdoor hash functions and their applications (Q2304914):
Displayed 39 items.
- Private information retrieval with sublinear online time (Q2055601) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more (Q2055662) (← links)
- Witness indistinguishability for any single-round argument with applications to access control (Q2055687) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- New constructions of hinting PRGs, OWFs with encryption, and more (Q2096498) (← links)
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations (Q2104241) (← links)
- Password protected secret sharing from lattices (Q2117043) (← links)
- Large message homomorphic secret sharing from DCR and applications (Q2129016) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Batch-OT with optimal rate (Q2170043) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← 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)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- Laconic private set intersection and applications (Q2697887) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Efficient laconic cryptography from learning with errors (Q6063527) (← links)
- Algebraic restriction codes and their applications (Q6066762) (← links)
- Bounded functional encryption for Turing machines: adaptive security from general assumptions (Q6114255) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions (Q6134825) (← links)
- How to build a trapdoor function from an encryption scheme (Q6157550) (← links)
- Statistically sender-private OT from LPN and derandomization (Q6163969) (← links)
- Round-optimal black-box MPC in the plain model (Q6186598) (← links)
- A framework for statistically sender private OT with optimal rate (Q6186604) (← links)
- Non-interactive zero-knowledge from non-interactive batch arguments (Q6186697) (← links)
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH (Q6186714) (← links)
- Correlation intractability and SNARGs from sub-exponential DDH (Q6190125) (← links)
- A note on non-interactive zero-knowledge from CDH (Q6190128) (← links)