|
[Resource Topic] 2025/2065: TensorSwitch: Nearly Optimal Polynomial Commitments from Tensor Codes
|
|
0
|
14
|
November 13, 2025
|
|
[Resource Topic] 2025/2064: Security of Private Set Operation Schemes: Separations and Implications
|
|
0
|
14
|
November 13, 2025
|
|
[Resource Topic] 2025/2063: QUIC-MLS: Making a Space Security Draft Standard Resilient for Disconnected Environments
|
|
0
|
21
|
November 9, 2025
|
|
[Resource Topic] 2025/2048: Time-Lock Encrypted Storage for Blockchains
|
|
0
|
16
|
November 6, 2025
|
|
[Resource Topic] 2025/2042: Threshold Anonymous Credentials with Silent Setup
|
|
0
|
24
|
November 5, 2025
|
|
[Resource Topic] 2025/2041: Sum-check Is All You Need: An Opinionated Survey on Fast Provers in SNARK Design
|
|
0
|
19
|
November 5, 2025
|
|
[Resource Topic] 2025/2039: Non-Delegatable Commitments
|
|
0
|
25
|
November 5, 2025
|
|
[Resource Topic] 2025/2037: On the Simulation-Extractability of Proof-Carrying Data
|
|
0
|
22
|
November 5, 2025
|
|
[Resource Topic] 2025/2035: Multivariate Commitments and Signatures with Efficient Protocols
|
|
0
|
20
|
November 5, 2025
|
|
[Resource Topic] 2025/2030: Succinct Zero-knowledge Proofs from One-way Functions:The Blackbox Way
|
|
0
|
22
|
November 3, 2025
|
|
[Resource Topic] 2025/2024: A Note Comparing Three Incentive Designs Against Privacy-Targeted Collusion
|
|
0
|
20
|
November 3, 2025
|
|
[Resource Topic] 2025/2023: Select-Then-Compute: Encrypted Label Selection and Analytics over Distributed Datasets using FHE
|
|
0
|
31
|
November 1, 2025
|
|
[Resource Topic] 2025/2022: Formal Verification of Privacy Pass
|
|
0
|
17
|
November 1, 2025
|
|
[Resource Topic] 2025/2021: TreeCast: Multi-Party Key Establishment Protocol for IoT Devices
|
|
0
|
23
|
November 1, 2025
|
|
[Resource Topic] 2025/2020: VerfCNN, Optimal Complexity zkSNARK for Convolutional Neural Networks
|
|
0
|
19
|
November 1, 2025
|
|
[Resource Topic] 2025/2019: Practical Multi-party Private Set Intersection with Reducible Zero-sharing
|
|
0
|
23
|
November 1, 2025
|
|
[Resource Topic] 2025/2018: Batched and Packed (Publicly) Verifiable Secret Sharing: A Unified Framework and Applications
|
|
0
|
20
|
November 1, 2025
|
|
[Resource Topic] 2025/2017: Secure Onion Encryption and the Case of Counter Galois Onion
|
|
0
|
23
|
November 1, 2025
|
|
[Resource Topic] 2025/2015: Proving Authenticated Key Exchange via Memory-Efficient Reductions
|
|
0
|
21
|
November 1, 2025
|
|
[Resource Topic] 2025/2008: Two-Server Private Information Retrieval in Sublinear Time and Quasilinear Space
|
|
0
|
20
|
November 1, 2025
|
|
[Resource Topic] 2025/2007: k-Anonymous Group Signatures: Addressing Strict Content Moderation in End-to-End Secure Messaging Platforms
|
|
0
|
25
|
October 30, 2025
|
|
[Resource Topic] 2025/2006: OmniBA: Round-Efficient BA with Quadratic Communication under Mixed Faults
|
|
0
|
34
|
October 30, 2025
|
|
[Resource Topic] 2025/2002: Pseudorandom Correlation Functions for Multiparty Beaver Triples from Sparse LPN
|
|
0
|
28
|
October 30, 2025
|
|
[Resource Topic] 2025/2001: On Computational VSS for General Access Structures
|
|
0
|
19
|
October 30, 2025
|
|
[Resource Topic] 2025/1995: Device-Bound Anonymous Credentials With(out) Trusted Hardware
|
|
0
|
26
|
October 30, 2025
|
|
[Resource Topic] 2025/1993: A Simplified Round-by-round Soundness Proof of FRI
|
|
0
|
32
|
October 30, 2025
|
|
[Resource Topic] 2025/1989: HardCODE: Hardware-based Circuit Obfuscation using Data Encryption
|
|
0
|
26
|
October 30, 2025
|
|
[Resource Topic] 2025/1986: Anonymous Authentication and Key Agreement, Revisited
|
|
0
|
26
|
October 29, 2025
|
|
[Resource Topic] 2025/1985: OUF: Oblivious Universal Function with domain specific optimizations
|
|
0
|
19
|
October 29, 2025
|
|
[Resource Topic] 2025/1981: Vision: A Modular Framework for Anonymous Credential Systems
|
|
0
|
24
|
October 29, 2025
|