|
[Resource Topic] 2025/453: Verifiable Secret Sharing Based on Fully Batchable Polynomial Commitment for Privacy-Preserving Distributed Computation
|
|
0
|
1
|
March 12, 2025
|
|
[Resource Topic] 2025/451: Analysis of the Telegram Key Exchange
|
|
0
|
4
|
March 11, 2025
|
|
[Resource Topic] 2025/449: Concretely Efficient Correlated Oblivious Permutation
|
|
0
|
0
|
March 11, 2025
|
|
[Resource Topic] 2025/446: Disincentivize Collusion in Verifiable Secret Sharing
|
|
0
|
0
|
March 10, 2025
|
|
[Resource Topic] 2025/444: Multiparty Garbling from OT with Linear Scaling and RAM Support
|
|
0
|
2
|
March 10, 2025
|
|
[Resource Topic] 2025/443: Homomorphic Signature-based Witness Encryption and Applications
|
|
0
|
2
|
March 10, 2025
|
|
[Resource Topic] 2025/438: Transmitting Secrets by Transmitting only Plaintext
|
|
0
|
2
|
March 10, 2025
|
|
[Resource Topic] 2025/430: Non-interactive Anonymous Tokens with Private Metadata Bit
|
|
0
|
2
|
March 6, 2025
|
|
[Resource Topic] 2025/427: BUFFing Threshold Signature Schemes
|
|
0
|
0
|
March 5, 2025
|
|
[Resource Topic] 2025/426: Exploring How to Authenticate Application Messages in MLS: More Efficient, Post-Quantum, and Anonymous Blocklistable
|
|
0
|
0
|
March 5, 2025
|
|
[Resource Topic] 2025/424: Matchmaker: Fast Secure Inference across Deployment Scenarios
|
|
0
|
2
|
March 5, 2025
|
|
[Resource Topic] 2025/423: Multi-Client Attribute-Based Unbounded Inner Product Functional Encryption, and More
|
|
0
|
0
|
March 5, 2025
|
|
[Resource Topic] 2025/422: Private Computation on Common Fuzzy Records
|
|
0
|
1
|
March 5, 2025
|
|
[Resource Topic] 2025/420: Non-Interactive Verifiable Aggregation
|
|
0
|
3
|
March 5, 2025
|
|
[Resource Topic] 2025/419: Samaritan: Linear-time Prover SNARK from New Multilinear Polynomial Commitments
|
|
0
|
2
|
March 5, 2025
|
|
[Resource Topic] 2025/410: TreeKEM: A Modular Machine-Checked Symbolic Security Analysis of Group Key Agreement in Messaging Layer Security
|
|
0
|
2
|
March 4, 2025
|
|
[Resource Topic] 2025/409: Low Communication Threshold FHE from Standard (Module-)LWE
|
|
0
|
1
|
March 4, 2025
|
|
[Resource Topic] 2025/408: Hybrid Obfuscated Key Exchange and KEMs
|
|
0
|
1
|
March 4, 2025
|
|
[Resource Topic] 2025/406: AsyRand: fast asynchronous distributed randomness beacon with reconfiguration
|
|
0
|
0
|
March 4, 2025
|
|
[Resource Topic] 2025/404: SNARKs for Stateful Computations on Authenticated Data
|
|
0
|
1
|
March 4, 2025
|
|
[Resource Topic] 2025/393: An Efficient Quantum Oblivious Transfer Protocol
|
|
0
|
3
|
March 4, 2025
|
|
[Resource Topic] 2025/389: An ETSI GS QKD compliant TLS implementation
|
|
0
|
1
|
March 4, 2025
|
|
[Resource Topic] 2025/385: MERCURY: A multilinear Polynomial Commitment Scheme with constant proof size and no prover FFTs
|
|
0
|
6
|
March 4, 2025
|
|
[Resource Topic] 2025/382: On the Security and Privacy of CKKS-based Homomorphic Evaluation Protocols
|
|
0
|
0
|
March 4, 2025
|
|
[Resource Topic] 2025/371: Functional Oblivious Transfer with Applications in Privacy-Preserving Machine Learning
|
|
0
|
0
|
March 4, 2025
|
|
[Resource Topic] 2025/364: Traitor Tracing in Multi-sender Setting ($\textsf{TMCFE}$: Traceable Multi-client Functional Encryption)
|
|
0
|
0
|
March 4, 2025
|
|
[Resource Topic] 2024/1963: Proof of Time: A Method for Verifiable Temporal Commitments Without Timestamp Disclosure
|
|
1
|
5
|
February 28, 2025
|
|
[Resource Topic] 2025/354: Delayed-Input Multi-Party Computation
|
|
0
|
3
|
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
|