Classes
- Complexity for CryptographyNMMB405 | Faculty of Mathematics and Physics
- Probability and CryptographyNMMB407 | Faculty of Mathematics and Physics
- Randomness and CalculationsNMMB432 | Faculty of Mathematics and Physics
- Foundations of theoretical cryptography +1NTIN104 | Faculty of Mathematics and Physics
Publications
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir2019 | Faculty of Mathematics and Physics
- PPP-Completeness and Extremal Combinatorics2023 | Faculty of Mathematics and Physics
- Tortoise and Hares Consensus: The Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies2021 | Faculty of Mathematics and Physics
- On Search Complexity of Discrete Logarithm2021 | Faculty of Mathematics and Physics
- On Average-Case Hardness in TFNP from One-Way Functions2020 | Faculty of Mathematics and Physics
- HARDNESS OF CONTINUOUS LOCAL SEARCH: QUERY COMPLEXITY AND CRYPTOGRAPHIC LOWER BOUNDS2020 | Faculty of Mathematics and Physics
- Stronger Lower Bounds for Online ORAM2019 | Faculty of Mathematics and Physics
- ARRIVAL: Next Stop in CLS2018 | Faculty of Mathematics and Physics
- An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge2018 | Faculty of Mathematics and Physics
- Must the Communication Graph of MPC Protocols be an Expander? +12018 | Faculty of Mathematics and Physics
Loading network view...