cover_image

Kurt Pan 密码周刊 (3)

Kurt Pan XPTY
2021年01月22日 00:00

It is mainly for my own use.

If there is something useful to other people, it is just an extra property that will make me happy :)

Papers

  • SoK: Computer-Aided Cryptography: https://eprint.iacr.org/2019/1393.pdf
  • Efficient Lattice-Based Inner-Product Functional Encryption: https://eprint.iacr.org/2021/046.pdf
  • Efficient Lattice Gadget Decomposition Algorithm with Bounded Uniform Distribution: https://eprint.iacr.org/2021/048.pdf
  • Elementary Attestation of Cryptographically Useful Composite Moduli: https://eprint.iacr.org/2021/052.pdf
  • On Algebraic Embedding for Unstructured Lattices: https://eprint.iacr.org/2021/053.pdf
  • The Study of Modulo  - A General Method To Calculate The Probability Or Correlation Coefficients For The Any Property Of Modulo : https://eprint.iacr.org/2021/056.pdf
  • Correlation Intractability vs. One-wayness: https://eprint.iacr.org/2021/057.pdf
  • On the Cost of Adaptivity in Graph-Based Games: https://eprint.iacr.org/2021/059.pdf
  • UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts: https://eprint.iacr.org/2021/060.pdf
  • Compressed Permutation Oracles And the Collision-Resistance of Sponge/SHA3: https://eprint.iacr.org/2021/062.pdf
  • Fault Attacks on CCA-secure Lattice KEMs: https://eprint.iacr.org/2021/064.pdf
  • Beyond the Worst-Case Analysis of Algorithms (Introduction): https://arxiv.org/abs/2007.13241

Posts

  • Who Can Name the Bigger Number?: https://www.scottaaronson.com/writings/bignumbers.html
  • IPFS Support in Brave: https://brave.com/ipfs-support/
  • Please Stop Encrypting with RSA Directly: https://soatok.blog/2021/01/20/please-stop-encrypting-with-rsa-directly/
  • Formalising mathematics: an introduction.: https://xenaproject.wordpress.com/2021/01/21/formalising-mathematics-an-introduction/
  • Zero-Knowledge: PLONK Demo : https://dusk.network/news/zero-knowledge-plonk-demo
  • Zero-Knowledge: PLONK Demo 2 : https://dusk.network/news/zero-knowledge-plonk-demo-2
  • Mathematicians Resurrect Hilbert’s 13th Problem: https://www.quantamagazine.org/mathematicians-probe-unsolved-hilbert-polynomial-problem-20210114/
  • 读懂比特币协议重要里程碑：Schnorr 签名和 Taproot 软分叉升级: https://www.chainnews.com/articles/523414989174.htm

Videos

  • Cybersecurity: Are you Really Protected? - Ep 31: https://www.youtube.com/watch?v=Qsm-K4NFxX0&feature=youtu.be&utm_campaign=2021+Social+Media+Posts&utm_content=151680742&utm_medium=social&utm_source=twitter&hss_channel=tw-2837476655
  • P=NP? by Richard E. BORCHERDS: https://www.youtube.com/watch?v=ACfvkk5gDVs
  • Scaling Computations on Blockchains with ZK-STARKs_Invited talk by Eli Ben-Sasson: https://www.youtube.com/watch?v=8vduDYBu8uQ&t=1346s

Books

  • Real-World Cryptography: https://www.manning.com/books/real-world-cryptography
  • Proofs: A Long-Form Mathematics Textbook: https://www.amazon.com/dp/B08T8JCVF1?ref_=pe_3052080_397514860

Conferences/ Events/ Courses

  • (01/27) Intro to Secure Multiparty Computation (MPC): https://www.meetup.com/fhe-org/events/275347033/?isFromReg=true

  • (02/01-02-05) QIP 2021: https://www.mcqst.de/qip2021/

  • Quantum Complexity Theory at Paderborn University, Germany：https://www.youtube.com/watch?v=Cn8pcG_9fX0&list=PLZGjbQcY0aI7Yqwbwp-lsf1tTPyvkQG6h

  • Oxford Set Theory Seminar: http://jdh.hamkins.org/oxford-set-theory-seminar/#Sinapova

  • Proceedings of the Fourteenth Algorithmic Number Theory Symposium: https://msp.org/obs/2020/4-1/

Libraries

  • https://github.com/veorq/cryptocoding

Kurt Pan 密码周刊 (1)

Kurt Pan 密码周刊 (2)