Welcome to Ask Cryptography
|
|
1
|
3203
|
August 1, 2022
|
[Resource Topic] 2025/1030: Everlasting Anonymous Rate-Limited Tokens
|
|
0
|
0
|
June 3, 2025
|
[Resource Topic] 2025/1029: Improved Key Recovery Attacks of Ascon
|
|
0
|
0
|
June 3, 2025
|
[Resource Topic] 2025/1028: Group Key Progression: Strong Security for Shared Persistent Data
|
|
0
|
0
|
June 3, 2025
|
[Resource Topic] 2025/1027: Parallel Repetition for Post-Quantum Arguments
|
|
0
|
0
|
June 3, 2025
|
[Resource Topic] 2025/1026: Malicious Security in Collaborative zk-SNARKs: More than Meets the Eye
|
|
0
|
0
|
June 3, 2025
|
[Resource Topic] 2025/1025: Secure Noise Sampling for Differentially Private Collaborative Learning
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1024: Towards Trustless Provenance: A Privacy-Preserving Framework for On-chain Media Verification
|
|
0
|
0
|
June 2, 2025
|
[Resource Topic] 2025/1023: Universal Channel Rebalancing: Flexible Coin Shifting in Payment Channel Networks
|
|
0
|
0
|
June 2, 2025
|
[Resource Topic] 2025/1022: Burn Your Vote: Decentralized and Publicly Verifiable Anonymous Voting at Scale
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1021: Black-Box Crypto is Useless for Pseudorandom Codes
|
|
0
|
0
|
June 2, 2025
|
[Resource Topic] 2025/1020: Separating Pseudorandom Codes from Local Oracles
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1019: Silent Splitter: Privacy for Payment Splitting via New Protocols for Distributed Point Functions
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1018: MT-TMVP: Modular Tiled TMVP-based Polynomial Multiplication for Post-Quantum Cryptography on FPGAs
|
|
0
|
0
|
June 2, 2025
|
[Resource Topic] 2025/1017: Using the Schur Product to Solve the Code Equivalence Problem
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1016: Leader Election with Poly-logarithmic Communication Per Party
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1015: Zero-Knowledge Polynomial Commitment in Binary Fields
|
|
0
|
0
|
June 2, 2025
|
[Resource Topic] 2025/1014: How to Make Any Computational Secret Sharing Scheme Adaptively Secure
|
|
0
|
2
|
June 2, 2025
|
[Resource Topic] 2025/1013: Silentium: Implementation of a Pseudorandom Correlation Generator for Beaver Triples
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1012: Nearly Optimal Parallel Broadcast in the Plain Public Key Model
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1011: Adaptive TDFs from Injective TDFs
|
|
0
|
0
|
June 2, 2025
|
[Resource Topic] 2025/1010: UPKE and UKEM Schemes from Supersingular Isogenies
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1009: Adaptively Secure Three-Round Threshold Schnorr Signatures from DDH
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1008: Reviving a Grover based Quantum Secret Sharing Scheme
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1007: Scalable Multiparty Computation from Non-linear Secret Sharing
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1006: Adding Feeding Forward Back to the Sponge Construction
|
|
0
|
0
|
June 2, 2025
|
[Resource Topic] 2025/1005: TEAKEX: TESLA-Authenticated Group Key Exchange
|
|
0
|
0
|
June 2, 2025
|
[Resource Topic] 2025/1004: On Factoring and Power Divisor Problems via Rank-3 Lattices and the Second Vector
|
|
0
|
0
|
June 2, 2025
|
[Resource Topic] 2025/1003: Low-Latency Dynamically Available Total Order Broadcast
|
|
0
|
1
|
June 2, 2025
|
[Resource Topic] 2025/1002: Cool + Cruel = Dual
|
|
0
|
1
|
June 2, 2025
|