[Resource Topic] 2024/1963: Proof of Time: A Method for Verifiable Temporal Commitments Without Timestamp Disclosure
|
|
1
|
2
|
February 28, 2025
|
[Resource Topic] 2025/354: Delayed-Input Multi-Party Computation
|
|
0
|
0
|
February 25, 2025
|
[Resource Topic] 2025/352: Efficient NIZK Arguments with Straight-Line Simulation and Extraction
|
|
0
|
0
|
February 25, 2025
|
[Resource Topic] 2025/349: Efficient Distributed Randomness Generation from Minimal Assumptions where PArties Speak Sequentially Once
|
|
0
|
1
|
February 25, 2025
|
[Resource Topic] 2025/348: Juicebox Protocol: Distributed Storage and Recovery of Secrets Using Simple PIN Authentication
|
|
0
|
0
|
February 25, 2025
|
[Resource Topic] 2025/347: Helix: Scalable Multi-Party Machine Learning Inference against Malicious Adversaries
|
|
0
|
0
|
February 25, 2025
|
[Resource Topic] 2025/344: Publicly Verifiable Generalized Secret Sharing and Its Application in Building Decentralized Exchange
|
|
0
|
1
|
February 25, 2025
|
[Resource Topic] 2025/342: Traceable Threshold Encryption without Trusted Dealer
|
|
0
|
0
|
February 25, 2025
|
[Resource Topic] 2025/341: CCA-Secure Traceable Threshold (ID-based) Encryption and Application
|
|
0
|
0
|
February 25, 2025
|
[Resource Topic] 2025/333: Leap: A Fast, Lattice-based OPRF With Application to Private Set Intersection
|
|
0
|
0
|
February 25, 2025
|
[Resource Topic] 2025/332: Towards Leakage-Resilient Ratcheted Key Exchange
|
|
0
|
0
|
February 25, 2025
|
[Resource Topic] 2025/329: Towards a White-Box Secure Fiat-Shamir Transformation
|
|
0
|
0
|
February 25, 2025
|
[Resource Topic] 2025/327: Bulletproofs for R1CS: Bridging the Completeness-Soundness Gap and a ZK Extension
|
|
0
|
0
|
February 25, 2025
|
[Resource Topic] 2025/318: Traceable Verifiable Secret Sharing and Applications
|
|
0
|
1
|
February 21, 2025
|
[Resource Topic] 2025/317: Minicrypt PIR for Big Batches
|
|
0
|
2
|
February 21, 2025
|
[Resource Topic] 2025/313: Lattice-based $\Sigma$-Protocols for Polynomial Relations with Standard Soundness
|
|
0
|
1
|
February 21, 2025
|
[Resource Topic] 2025/305: The Malice of ELFs: Practical Anamorphic-Resistant Encryption without Random Oracles
|
|
0
|
1
|
February 21, 2025
|
[Resource Topic] 2025/303: Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time
|
|
0
|
8
|
February 21, 2025
|
[Resource Topic] 2025/302: FHE-SNARK vs. SNARK-FHE: From Analysis to Practical Verifiable Computation
|
|
0
|
2
|
February 21, 2025
|
[Resource Topic] 2025/301: Making Protocol FSU Revocable
|
|
0
|
0
|
February 21, 2025
|
[Resource Topic] 2025/300: Pseudorandom Functions with Weak Programming Privacy and Applications to Private Information Retrieval
|
|
0
|
0
|
February 21, 2025
|
[Resource Topic] 2025/297: Practical Zero-Trust Threshold Signatures in Large-Scale Dynamic Asynchronous Networks
|
|
0
|
0
|
February 20, 2025
|
[Resource Topic] 2025/296: DFS: Delegation-friendly zkSNARK and Private Delegation of Provers
|
|
0
|
3
|
February 20, 2025
|
[Resource Topic] 2025/295: Stationary Syndrome Decoding for Improved PCGs
|
|
0
|
1
|
February 20, 2025
|
[Resource Topic] 2025/294: Neo: Lattice-based folding scheme for CCS over small fields and pay-per-bit commitments
|
|
0
|
0
|
February 20, 2025
|
[Resource Topic] 2025/286: Verifiable Computation for Approximate Homomorphic Encryption Schemes
|
|
0
|
0
|
February 20, 2025
|
[Resource Topic] 2025/285: MicroCrypt Assumptions with Quantum Input Sampling and Pseudodeterminism: Constructions and Separations
|
|
0
|
0
|
February 20, 2025
|
[Resource Topic] 2025/284: S2DV: Scalable and Secure DAO Voting
|
|
0
|
2
|
February 20, 2025
|
[Resource Topic] 2025/283: Honest Majority MPC with $\tilde{O}(|C|)$ Communication in Minicrypt
|
|
0
|
0
|
February 20, 2025
|
[Resource Topic] 2025/277: Tighter Control for Distributed Key Generation: Share Refreshing and Expressive Reconstruction Policies
|
|
0
|
0
|
February 19, 2025
|