Linked e-resources
Details
Table of Contents
Cryptanalysis
Multitarget decryption failure attacks and their application to Saber and Kyber
Post-quantum Security of Plain OAEP Transform
On the security of OSIDH
Time-Memory tradeoffs for large-weight syndrome decoding in ternary codes
Syndrome Decoding Estimator
On the Isogeny Problem with Torsion Point Information
MPC and Secret Sharing
Reusable Two-Round MPC from LPN
On the Bottleneck Complexity of MPC with Correlated Randomness
Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN
Fast Batched DPSS and its Applications
CNF-FSS and its Applications
Cryptographic Protocols
Effcient Verifiable Partially-Decryptable Commitments from Lattices and Applications
Making Private Function Evaluation Safer, Faster, and Simpler
Two-Round Oblivious Linear Evaluation from Learning with Errors
Improved Constructions of Anonymous Credentials From StructurePreserving Signatures on Equivalence Classes
Traceable PRFs: Full Collusion Resistance and Active Security
Tools
Radical Isogenies on Montgomery Curves
Towards a Simpler Lattice Gadget Toolkit
SNARKs and NIZKs
Polynomial IOPs for Linear Algebra Relations
A Unified Framework for Non-Universal SNARKs
ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines
Rational Modular Encoding in the DCR Setting: Non-Interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model. .
Multitarget decryption failure attacks and their application to Saber and Kyber
Post-quantum Security of Plain OAEP Transform
On the security of OSIDH
Time-Memory tradeoffs for large-weight syndrome decoding in ternary codes
Syndrome Decoding Estimator
On the Isogeny Problem with Torsion Point Information
MPC and Secret Sharing
Reusable Two-Round MPC from LPN
On the Bottleneck Complexity of MPC with Correlated Randomness
Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN
Fast Batched DPSS and its Applications
CNF-FSS and its Applications
Cryptographic Protocols
Effcient Verifiable Partially-Decryptable Commitments from Lattices and Applications
Making Private Function Evaluation Safer, Faster, and Simpler
Two-Round Oblivious Linear Evaluation from Learning with Errors
Improved Constructions of Anonymous Credentials From StructurePreserving Signatures on Equivalence Classes
Traceable PRFs: Full Collusion Resistance and Active Security
Tools
Radical Isogenies on Montgomery Curves
Towards a Simpler Lattice Gadget Toolkit
SNARKs and NIZKs
Polynomial IOPs for Linear Algebra Relations
A Unified Framework for Non-Universal SNARKs
ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines
Rational Modular Encoding in the DCR Setting: Non-Interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model. .