The following pages link to Joël Alwen (Q537916):
Displayed 29 items.
- Generating shorter bases for hard random lattices (Q537918) (← links)
- Sustained space complexity (Q1648824) (← links)
- Moderately hard functions: definition, instantiations, and applications (Q1690205) (← links)
- Beyond Hellman's time-memory trade-offs with applications to proofs of space (Q1703929) (← links)
- Analysing the HPKE standard (Q2056674) (← links)
- Security analysis and improvements for the IETF MLS standard for group messaging (Q2096486) (← links)
- Continuous group key agreement with active security (Q2119048) (← links)
- The double ratchet: security notions, proofs, and modularization for the Signal protocol (Q2292642) (← links)
- Efficiently Computing Data-Independent Memory-Hard Functions (Q2829217) (← links)
- Learning with Rounding, Revisited (Q2845660) (← links)
- On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption (Q2870085) (← links)
- Collusion-Preserving Computation (Q2914257) (← links)
- Key-Indistinguishable Message Authentication Codes (Q2922676) (← links)
- High Parallel Complexity Graphs and Memory-Hard Functions (Q2941555) (← links)
- Anonymous Authentication with Shared Secrets (Q2946477) (← links)
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model (Q3183555) (← links)
- Collusion-Free Multiparty Computation in the Mediated Model (Q3183583) (← links)
- Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting (Q3457094) (← links)
- Public-Key Encryption in the Bounded-Retrieval Model (Q3563832) (← links)
- Collusion-Free Protocols in the Mediated Model (Q3600237) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- Survey: Leakage Resilience and the Bounded Retrieval Model (Q4931663) (← links)
- Depth-Robust Graphs and Their Cumulative Memory Complexity (Q5270356) (← links)
- Scrypt Is Maximally Memory-Hard (Q5270357) (← links)
- Generating Shorter Bases for Hard Random Lattices (Q5389967) (← links)
- Impossibility and Feasibility Results for Zero Knowledge with Public Keys (Q5451023) (← links)
- On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model (Q5739208) (← links)
- On the insider security of MLS (Q6104328) (← links)
- Fork-resilient continuous group key agreement (Q6190118) (← links)