Kurt Pan 密码周刊 (7)

原创 Kurt Pan XPTY

2021年02月19日 00:00

Papers

A Security Framework for Distributed Ledgers

proposing the first framework for defining and analyzing the security of general distributed ledgers, with an ideal distributed ledger functionality, called F_ledger/ F_ledger is capable of precisely modeling also non-blockchain distributed ledgers by performing the first formal security analysis of such a distributed ledger, namely the prominent Corda protocol.
https://eprint.iacr.org/2021/145.pdf

Boolean Functions from Affine Functionals

the problem of evaluating boolean functions through affine-linear arithmetic functionals. show that each subset of the discrete unit cube admits an exact covering by affine hyperplanes/study the concrete construction of compact coverings, and provide new geometric algo- rithms.
https://eprint.iacr.org/2021/146.pdf

IPDL: A Simple Framework for Formally Verifying Distributed Cryptographic Protocols

framework, Interactive Probabilistic Dependency Logic (IPDL), for reasoning about a certain well-behaved subset of cryptographic protocols.
https://eprint.iacr.org/2021/147.pdf
https://github.com/ipdl/ipdl

On methods of shortening ElGamal-type signatures

propose three methods of shortening signatures (for any ElGamal-type schemes such as ECDSA, GOST and SM2) and analyze how applying these methods affects the security
https://eprint.iacr.org/2021/148.pdf

Quantum Security of the Legendre PRF

study the security of the Legendre PRF against quantum attackers, given classical queries only, and without quantum random-access memories. We give two algorithms that recover the key of a shifted Legendre symbol with unknown shift, with a complexity smaller than exhaustive search of the key.
https://eprint.iacr.org/2021/149.pdf

Two-Party Adaptor Signatures From Identification Schemes

show that signature schemes that are con- structed from identification (ID) schemes, which additionally satisfy certain homomorphic properties, can generically be transformed into adaptor signature schemes./ provide an impossibility result which proves that unique signature schemes (e.g., the BLS scheme) cannot be transformed into an adaptor signature scheme./ define two-party adaptor signature schemes with aggregatable public keys and show how to instantiate them via a generic transformation from ID-based signature schemes./ give instantiations of our generic transformations for the Schnorr, Katz-Wang and Guillou-Quisquater signature schemes.
https://eprint.iacr.org/2021/150.pdf

On Sufficient Oracles for Secure Computation with Identifiable Abort

show that for t ≤ n − 2 corruptions, oracles that return output to n − 1 parties are sufficient to obtain information-theoretically secure computation with identifiable abort./ introduce a new kind of secret sharing scheme which we call unanimously identifiable secret sharing with public and private shares (UISSwPPS)
https://eprint.iacr.org/2021/151.pdf

Hybrid Dual Attack on LWE with Arbitrary Secrets

study the hybrid dual attack over LWE problems for any secret distribution./shows that a hybrid dual attack can outperform a standalone dual attack, regardless of the secret distribution.
https://eprint.iacr.org/2021/152.pdf

On the Isogeny Problem with Torsion Point Information

present a more general reduction algorithm that generalises to all SIDH-type schemes. The main idea of our algorithm is to exploit available torsion point images together with the KLPT algorithm to obtain a linear system of equations over a certain residue class ring. Lifting the solution of this linear system yields the secret isogeny.
https://eprint.iacr.org/2021/153.pdf

Closed Timelike Curves Make Quantum and Classical Computing Equivalent

show that if CTCs existed, then quantum computers would be no more powerful than classical computers: both would have the (extremely large) power of the complexity class PSPACE
https://arxiv.org/pdf/0808.2669.pdf

Exploring Parallelism to Improve the Performance of FrodoKEM in Hardware

proposes optimized designs for FrodoKEM, concentrating on high throughput by parallelising the matrix multiplication operations/ use of Trivium
https://eprint.iacr.org/2021/155.pdf

Mechanized Proofs of Adversarial Complexity and Application to Universal Composability

enhance the EasyCrypt proof assistant to reason about computational complexity of adversaries/ key technical tool is a Hoare logic for reasoning about computational complexity (execution time and oracle calls) of adversarial computations/ present a new formalization of Universal Composability (UC)
https://eprint.iacr.org/2021/156.pdf

hbACSS: How to Robustly Share Many Secrets

a suite of optimal-resilience asynchronous complete secret sharing protocols that are (quasi)linear in both computation and communication overhead.
https://eprint.iacr.org/2021/159.pdf

Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance

An adaptively-secure variant of the efficient, selectively-secure LWE-based IBE scheme of Agrawal, Boneh, and Boyen (EUROCRYPT 2010). /Adaptively-secure variants of two efficient selectively-secure pairing-based IBEs of Boneh and Boyen (EUROCRYPT 2004). /A very efficient adaptively-secure verifiable random function
https://eprint.iacr.org/2021/160.pdf

Generic Adaptor Signature

propose the first generic construction of adaptor sig- natures which is compatible with different signature schemes
https://eprint.iacr.org/2021/161.pdf

Verifiable Capacity-bound Functions: A New Primitive from Kolmogorov Complexity

VCBF can be viewed as a “space” analog of a verifiable delay function./ propose the first VCBF construction relying on evaluating a degree-d polynomial f from Fp[x] at a random point.
https://eprint.iacr.org/2021/162.pdf

CNF-FSS and its Applications

Function Secret Sharing (FSS)/ CNF-FSS, where the scheme uses the CNF version of secret sharing (rather than additive sharing) to share each value f(x)
https://eprint.iacr.org/2021/163.pdf

Composition with Knowledge Assumptions

present a formal model allowing the composition of knowledge assumptions./ providing the first instance of a simultaneously succinct and composable zk-SNARK
https://eprint.iacr.org/2021/165.pdf

Small Leaks Sink a Great Ship: An Evaluation of Key Reuse Resilience of PQC Third Round Finalist NTRU-HRSS

propose a full key mismatch attack on NTRU- HRSS
https://eprint.iacr.org/2021/168.pdf

Security Analysis on an El-Gamal-like Multivariate Encryption Scheme Based on Isomorphism of Polynomials

Isomorphism of polynomials with two secrets (IP2S) problem/ block isomorphism of polynomials with circulant matrices (BIPC) problem
https://eprint.iacr.org/2021/169.pdf

Fully Anonymous Group Signature with Verifier-Local Revocation

VLR-GS/ show the construction of a fully anonymous VLR-GS scheme from a digital signature scheme, a key-private public key encryption scheme, and a non-interactive zero-knowledge proof system
https://eprint.iacr.org/2021/170.pdf

Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI

two important variants of mPSI - circuit PSI (that allows the parties to compute a function over the intersection set without revealing the intersection itself) and quorum PSI (that allows P1 to learn all the elements in his/her set that are present in at least k other sets)
https://eprint.iacr.org/2021/172.pdf

Posts & Videos

Title	Link
On BDD with Predicate: Breaking the “Lattice Barrier” for the Hidden Number Problem	https://martinralbrecht.wordpress.com/2020/12/10/on-bdd-with-predicate-breaking-the-lattice-barrier-for-the-hidden-number-problem/
PQShield's Quantum Threat White Paper Series	https://pqshield.com/quantum-threat/
Unifying Compiler Infrastructure for SNARKs, SMTs, & More	https://www.youtube.com/watch?v=MzWHml9hRn4
Halo Infinite	https://www.youtube.com/watch?v=TydI5xJlhqQ&t=3s
Real World Cryptographers Podcast : Yuval Ishai	https://www.buzzsprout.com/1393207/7860298