|
[Resource Topic] 2025/2130: Weightwise (almost) perfectly balanced functions: $t$-concatenation and the general Maiorana-McFarland class
|
|
0
|
4
|
November 21, 2025
|
|
[Resource Topic] 2025/2121: Generic and Algebraic Computation Models: When AGM Proofs Transfer to the GGM
|
|
0
|
8
|
November 21, 2025
|
|
[Resource Topic] 2025/2114: Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits
|
|
0
|
6
|
November 19, 2025
|
|
[Resource Topic] 2025/2110: A note on mutual correlated agreement for Reed-Solomon codes
|
|
0
|
8
|
November 19, 2025
|
|
[Resource Topic] 2025/2071: On Cryptography and Distribution Verification, with Applications to Quantum Advantage
|
|
0
|
1
|
November 13, 2025
|
|
[Resource Topic] 2025/2056: Unclonable Cryptography in Linear Quantum Memory
|
|
0
|
4
|
November 9, 2025
|
|
[Resource Topic] 2025/2055: On Proximity Gaps for Reed–Solomon Codes
|
|
0
|
2
|
November 9, 2025
|
|
[Resource Topic] 2025/2054: Optimal Proximity Gaps for Subspace-Design Codes and (Random) Reed-Solomon Codes
|
|
0
|
6
|
November 9, 2025
|
|
[Resource Topic] 2025/2051: All Polynomial Generators Preserve Distance with Mutual Correlated Agreement
|
|
0
|
4
|
November 9, 2025
|
|
[Resource Topic] 2025/2049: Black-Box Separation Between Multi-Collision Resistance and Collision Resistance
|
|
0
|
2
|
November 9, 2025
|
|
[Resource Topic] 2025/2046: On Reed–Solomon Proximity Gaps Conjectures
|
|
0
|
8
|
November 5, 2025
|
|
[Resource Topic] 2025/2010: On the Distribution of the Distances of Random Words
|
|
0
|
7
|
November 1, 2025
|
|
[Resource Topic] 2025/1998: Non-adaptive One-Way to Hiding not only Implies Adaptive Quantum Reprogramming, but also Does Better
|
|
0
|
7
|
October 30, 2025
|
|
[Resource Topic] 2025/1994: Separating Pseudorandom Generators from Logarithmic Pseudorandom States
|
|
0
|
2
|
October 30, 2025
|
|
[Resource Topic] 2025/1984: Fully Anonymous Secret Sharing
|
|
0
|
6
|
October 29, 2025
|
|
[Resource Topic] 2025/1980: Traceable Secret Sharing Revisited
|
|
0
|
5
|
October 29, 2025
|
|
[Resource Topic] 2025/1951: What is Cryptography Hiding from Itself?
|
|
0
|
18
|
October 20, 2025
|
|
[Resource Topic] 2025/1948: Feedback Lunch: Deep Feedback Codes for Wiretap Channels
|
|
0
|
11
|
October 20, 2025
|
|
[Resource Topic] 2025/1947: Minicrypt PRFs Do Not Admit Black-Box Oblivious Evaluations
|
|
0
|
1
|
October 20, 2025
|
|
[Resource Topic] 2025/1943: Circuit-Succinct Algebraic Batch Arguments from Projective Functional Commitments
|
|
0
|
7
|
October 20, 2025
|
|
[Resource Topic] 2025/1932: Decoding Balanced Linear Codes With Preprocessing
|
|
0
|
6
|
October 20, 2025
|
|
[Resource Topic] 2025/1930: Attention is still what you need: Another Round of Exploring Shoup’s GGM
|
|
0
|
1
|
October 20, 2025
|
|
[Resource Topic] 2025/1921: Multi-Copy Security in Unclonable Cryptography
|
|
0
|
1
|
October 17, 2025
|
|
[Resource Topic] 2025/1913: Unambiguous SNARGs for P from LWE with Applications to PPAD Hardness
|
|
0
|
14
|
October 17, 2025
|
|
[Resource Topic] 2025/1906: A Simple and Efficient One-Shot Signature Scheme
|
|
0
|
11
|
October 17, 2025
|
|
[Resource Topic] 2025/1898: Unique NIZKs and Steganography Detection
|
|
0
|
5
|
October 12, 2025
|
|
[Resource Topic] 2025/1894: Bounded-Equivocable Pseudorandom Functions
|
|
0
|
11
|
October 12, 2025
|
|
[Resource Topic] 2025/1889: Gluing Random Unitaries with Inverses and Applications to Strong Pseudorandom Unitaries
|
|
0
|
7
|
October 11, 2025
|
|
[Resource Topic] 2025/1887: Parallel Spooky Pebbling Makes Regev Factoring More Practical
|
|
0
|
6
|
October 11, 2025
|
|
[Resource Topic] 2025/1880: Copy-Protection from Unclonable Puncturable Obfuscation, Revisited
|
|
0
|
13
|
October 11, 2025
|