MPC in the head using the subfield bilinear collision problem
From MaRDI portal
Publication:6648188
DOI10.1007/978-3-031-68376-3_2MaRDI QIDQ6648188
Publication date: 4 December 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Constrained Pseudorandom Functions and Their Applications
- Solution theory for systems of bilinear equations
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- New directions in cryptography
- Foundations of Cryptography
- Multivariate Public Key Cryptosystems
- The return of the SDitH
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- Half-tree: halving the cost of tree expansion in COT and DPF
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
This page was built for publication: MPC in the head using the subfield bilinear collision problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648188)
