cover_image

Kurt Pan 密码周刊 (11)

Kurt Pan XPTY
2021年03月19日 00:00

Papers

  • Faster homomorphic comparison operations for BGV and BFV: https://eprint.iacr.org/2021/315.pdf

  • Reusable Two-Round MPC from LPN: https://eprint.iacr.org/2021/316.pdf

  • Oblivious TLS via Multi-Party Computation: https://eprint.iacr.org/2021/318.pdf

  • Rinocchio: SNARKs for Ring Arithmetic

    • enable verifying computations over rings/ construct the first designated-verifier SNARK for statements which are represented as circuits over a broader kind of commutative rings, namely those containing big enough exceptional sets./ Quadratic Ring Programs (QRPs)
    • https://eprint.iacr.org/2021/322.pdf

  • 0

    • https://eprint.iacr.org/2021/323.pdf
    • crypto bugs in four BLS signatures’ libraries (ethereum/py ecc, supranational/blst, herumi/bls, sigp/milagro bls) that revolve around 0./”splitting zero” attacks to show a weakness in the proof-of-possession aggregate signature scheme standardized in BLS RFC draft v4.

  • Two Efficient Regulatory Confidential Transaction Schemes: https://eprint.iacr.org/2021/329.pdf

  • Sumcheck Arguments and their Applications

    • https://eprint.iacr.org/2021/333.pdf

  • Post-Quantum Succinct Arguments

    • prove that Kilian’s four-message succinct argument system is post-quantum secure in the standard model when instantiated with any probabilistically checkable proof and any collapsing hash function (which in turn exist based on the post-quantum hardness of Learning with Errors). At the heart of our proof is a new “measure-and-repair” quantum rewinding procedure that achieves asymptotically optimal knowledge error.
    • https://eprint.iacr.org/2021/334.pdf

  • Lattice-Based Proof of Shuffle and Applications to Electronic Voting

    • propose the first practical verifiable shuffle of known values for lattice-based commitments./ build a practical lattice-based cryptographic voting system that supports complex ballots
    • https://eprint.iacr.org/2021/338.pdf

  • Non-interactive distributed key generation and key resharing: https://eprint.iacr.org/2021/339.pdf

  • Merkle Trees Optimized for Stateless Clients in Bitcoin: https://eprint.iacr.org/2021/340.pdf

  • N-for-1 Auth: N-wise Decentralized Authentication via One Authentication: https://eprint.iacr.org/2021/342.pdf

  • Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups: https://eprint.iacr.org/2021/343.pdf

  • Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security: https://eprint.iacr.org/2021/346.pdf

  • Attacking (EC)DSA With Partially Known Multiples of Nonces: https://eprint.iacr.org/2021/347.pdf

  • Post-quantum Resettably-Sound Zero Knowledge

    • https://eprint.iacr.org/2021/349.pdf

  • One-Way Functions Imply Secure Computation in a Quantum World: https://eprint.iacr.org/2020/1487.pdf

  • Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures: https://eprint.iacr.org/2021/350.pdf

  • Practical Dynamic Group Signatures Without Knowledge Extractors: https://eprint.iacr.org/2021/351.pdf

  • Succinct Publicly Verifiable Computation

    • a delegation scheme for arithmetic circuits with proof-size and verification complexity comparable to those of pairing based zk-SNARKS (e.g. Gennaro et al. at Eurocrypt 2013 or Groth at Eurocrypt 2016), but based on standard assumptions
    • https://eprint.iacr.org/2021/353.pdf

  • Efficient permutation protocol for MPC in the head: https://eprint.iacr.org/2021/354.pdf

  • A Hard Crystal - Implementing Dilithium on Reconfigurable Hardware: https://eprint.iacr.org/2021/355.pdf

  • Time- and Space-Efficient Arguments from Groups of Unknown Order: https://eprint.iacr.org/2021/358.pdf

CT-RSA 2021

https://sites.google.com/site/ctrsa2021/accepted-papers

  • Mesh Messaging in Large-scale Protests: Breaking Bridgefy
  • Cryptanalysis of a Dynamic Universal Accumulator over Bilinear Groups
  • Compilation of Function Representations for Secure Computing Paradigms
  • On the Hardness of Module-LWE with Binary Secret
  • SoK: How (not) to Design and Implement Post-Quantum Cryptography
  • SoK: Game-based Security Models for Group Key Exchange
  • Dual lattice attacks for closest vector problems (with preprocessing)
  • Balancing Privacy and Accountability in Blockchain Identity Management
  • Oblivious TLS via Multi-Party Computation
  • Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
  • Signed Diffie-Hellman Key Exchange with Tight Security
  • Lattice-Based Proof of Shuffle and Applications to Electronic Voting

Posts & Videos

TitleLink
全同态加密学习路线https://mp.weixin.qq.com/s/TZZAt-7vPb9XhhdoBPG30A
“九章”作者对涂传诒先生等若干网络评论文章的回复https://mp.weixin.qq.com/s/mL37h4ZLVc-NmdmxN_kGWA
矩阵元获批“上海市数据隐私安全计算企业重点实验室https://mp.weixin.qq.com/s/UtEf3hbQsxmsTen2MCtZAQ
Applied Crypto: One Public Key for the Internet Computerhttps://medium.com/dfinity/applied-crypto-one-public-key-for-the-internet-computer-ni-dkg-4af800db869d
A Technical Overview of the Internet Computerhttps://medium.com/dfinity/a-technical-overview-of-the-internet-computer-f57c62abc20f
A Closer Look at Software Canisters, an Evolution of Smart Contractshttps://medium.com/dfinity/software-canisters-an-evolution-of-smart-contracts-internet-computer-f1f92f1bfffb
Candid: A Common Language for Application Interfaces on the Internet Computerhttps://medium.com/dfinity/candid-a-tool-for-interoperable-programming-languages-on-the-internet-computer-27e7085cd97f
2 Win Abel Prize for Work That Bridged Math and Computer Sciencehttps://www.nytimes.com/2021/03/17/science/abel-prize-mathematics.html
Pioneers Linking Math and Computer Science Win the Abel Prizehttps://www.quantamagazine.org/avi-wigderson-and-laszlo-lovasz-win-abel-prize-20210317/
Cheerful News in Difficult Times: The Abel Prize is Awarded to László Lovász and Avi Wigdersonhttps://gilkalai.wordpress.com/2021/03/17/cheerful-news-in-difficult-times-the-abel-prize-is-awarded-to-laszlo-lovasz-and-avi-wigderson/
The Abel Prize announcement 2021https://www.youtube.com/watch?v=0_NK_OkpmUY
The Curious History of the Schwartz-Zippel Lemmahttps://rjlipton.wordpress.com/2009/11/30/the-curious-history-of-the-schwartz-zippel-lemma/
History of Succinct Argumentshttp://people.csail.mit.edu/vinodv/6876-Spring2020/Ward.pdf
The Erica Show EP23 - Eli Ben-Sasson, Co-Founder and President of StarkWarehttps://www.youtube.com/watch?v=PyCMKf0gD6k

Resources & Events

  • Avi Wigderson's book: math and computation

    • https://www.math.ias.edu/avi/book

  • 《Introduction to Security Reduction》视频 郭福春

    • https://space.bilibili.com/2095536965

  • Cairo 101 Workshop

    • https://www.youtube.com/playlist?list=PLcIyXLwiPilV5RBZj43AX1FY4FJMWHFTY

  • https://github.com/ethereum/py_ecc/

  • https://github.com/supranational/blst

  • https://zk.money/

  • https://aztec.network/

  • https://minaprotocol.com/


往期周刊回顾：


Kurt Pan 密码周刊往期回顾 (1-10)


为了方便电脑用户，以及更开放的互联网访问，周刊内容会同步发布在Gitbook。

点击【阅读原文】👇可访问