[Resource Topic] 2023/1889: Fully Parallel, One-Cycle Random Shuffling for Efficient Countermeasure in Post-Quantum Cryptography
|
|
0
|
12
|
December 8, 2023
|
[Resource Topic] 2023/1888: Reverie: an end-to-end accumulation scheme from Cyclefold
|
|
0
|
12
|
December 8, 2023
|
[Resource Topic] 2023/1871: B2T: The Third Logical Value of a Bit
|
|
0
|
16
|
December 6, 2023
|
[Resource Topic] 2023/1869: Accountable Bulletin Boards: Definition and Provably Secure Implementation
|
|
0
|
9
|
December 6, 2023
|
[Resource Topic] 2023/1867: Different Flavours of HILL Pseudoentropy and Yao Incompressibility Entropy
|
|
0
|
8
|
December 6, 2023
|
[Resource Topic] 2023/1857: A Simple and Efficient Framework of Proof Systems for NP
|
|
0
|
9
|
December 6, 2023
|
[Resource Topic] 2023/1854: A note on quantum approximate optimization algorithm
|
|
0
|
12
|
December 4, 2023
|
[Resource Topic] 2023/1847: Cycle Structure and Observability of Two Types of Galois NFSRs
|
|
0
|
11
|
December 1, 2023
|
[Resource Topic] 2023/1844: Unconditionally Secure Commitments with Quantum Auxiliary Inputs
|
|
0
|
13
|
December 1, 2023
|
[Resource Topic] 2023/1841: Unclonable Cryptography with Unbounded Collusions
|
|
0
|
11
|
December 1, 2023
|
[Resource Topic] 2023/1839: Ring-LWE Hardness Based on Ideals of Hidden Orders of Number Fields
|
|
0
|
14
|
December 1, 2023
|
[Resource Topic] 2023/1825: Unclonable Cryptography in the Plain Model
|
|
0
|
15
|
November 28, 2023
|
[Resource Topic] 2023/1819: Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs
|
|
0
|
15
|
November 27, 2023
|
[Resource Topic] 2023/1818: On the Feasibility of Unleveled Fully-Homomorphic Signatures
|
|
0
|
9
|
November 27, 2023
|
[Resource Topic] 2023/1809: PURED: A unified framework for resource-hard functions
|
|
0
|
14
|
November 24, 2023
|
[Resource Topic] 2023/1802: Sublinear-Communication Secure Multiparty Computation does not require FHE
|
|
0
|
16
|
November 24, 2023
|
[Resource Topic] 2023/1799: BabySpartan: Lasso-based SNARK for non-uniform computation
|
|
0
|
18
|
November 24, 2023
|
[Resource Topic] 2023/1797: A Modular Approach to Unclonable Cryptography
|
|
0
|
16
|
November 24, 2023
|
[Resource Topic] 2023/1795: Efficiently Testable Circuits without Conductivity
|
|
0
|
12
|
November 24, 2023
|
[Resource Topic] 2023/1783: An efficient quantum parallel repetition theorem and applications
|
|
0
|
22
|
November 20, 2023
|
[Resource Topic] 2023/1782: A Solution to a Conjecture on the Maps $\chi_n^{(k)}$
|
|
0
|
20
|
November 20, 2023
|
[Resource Topic] 2023/1776: Watermarks in the Sand: Impossibility of Strong Watermarking for Generative Models
|
|
0
|
18
|
November 17, 2023
|
[Resource Topic] 2023/1772: Robust Combiners and Universal Constructions for Quantum Cryptography
|
|
0
|
23
|
November 17, 2023
|
[Resource Topic] 2023/1766: Introducing Clapoti(s): Evaluating the isogeny class group action in polynomial time
|
|
0
|
24
|
November 17, 2023
|
[Resource Topic] 2023/1765: The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False
|
|
0
|
23
|
November 17, 2023
|
[Resource Topic] 2023/1757: Adaptively Secure Consensus with Linear Complexity (and Constant Round) under Honest Majority in the Bare PKI Model, and Separation Bounds from the Idealized Message-Authentication Model
|
|
0
|
25
|
November 14, 2023
|
[Resource Topic] 2023/1756: How to Use Quantum Indistinguishability Obfuscation
|
|
0
|
18
|
November 14, 2023
|
[Resource Topic] 2023/1750: A Statistical Verification Method of Random Permutations for Hiding Countermeasure Against Side-Channel Attacks
|
|
0
|
22
|
November 13, 2023
|
[Resource Topic] 2023/1743: Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions
|
|
0
|
22
|
November 13, 2023
|
[Resource Topic] 2023/1741: Pseudorandom Isometries
|
|
0
|
16
|
November 13, 2023
|