Adaptively Secure, Universally Composable Distributed Generation of Discrete-Logarithm Based Keys from Standard Assumptions
Hanna Ek, Kelsey Melissaris, Lawrence Roy
2026Year
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get e8388cae-b76c-49f7-980b-40126d0138acRelated papers
- Post-Quantum Blind Signature from Standard Group Action Assumptions and MoreLucjan Hanzlik, Yi-Fu Lai, Eugenio Paracucchi, Edoardo PersichettiEUROCRYPT 2026 · 1 citation
- Fine-Grained Non-interactive Key-Exchange Without Idealized AssumptionsYuyu Wang, Chuanjie Su, Jiaxin PanCRYPTO 2024 · 1 citation
- Adaptively Secure Computation for RAM ProgramsLaasya Bangalore, Rafail Ostrovsky, Oxana Poburinnaya, Muthuramakrishnan VenkitasubramaniamEUROCRYPT 2022
- Round-Optimal GUC-Secure Blind Signatures From Minimal Computational and Setup Assumptions - From Minimal Computational and Setup AssumptionsMichele Ciampi, Pierpaolo Della Monica, Ivan ViscontiCRYPTO 2026 · 1 citation
- Kairos: Efficient High-Threshold Asynchronous Distributed Key Generation from Lightweight CryptographyXinxin Xing, Yizhong Liu, Zifan Li, Jianwei Liu et al.CCS 2026
