More Efficient Digital Signatures with Tight Multi-user Security

被引:0
|
作者
Diemert, Denis [1 ]
Gellert, Kai [1 ]
Jager, Tibor [1 ]
Lyu, Lin [1 ]
机构
[1] Bergische Universität Wuppertal, Wuppertal, Germany
关键词
723 Computer Software; Data Handling and Applications - 723.5 Computer Applications - 913.1 Production Engineering;
D O I
暂无
中图分类号
学科分类号
摘要
Efficiency
引用
收藏
页码:1 / 31
相关论文
共 50 条
  • [1] On Signatures with Tight Security in the Multi-User Setting
    Hanaoka, Goichiro
    Schuldt, Jacob C. N.
    PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016), 2016, : 91 - 95
  • [2] Signatures with Tight Multi-user Security from Search Assumptions
    Pan, Jiaxin
    Ringerud, Magnus
    COMPUTER SECURITY - ESORICS 2020, PT II, 2020, 12309 : 485 - 504
  • [3] Efficient and Tight Oblivious Transfer from PKE with Tight Multi-user Security
    Badrinarayanan, Saikrishna
    Masny, Daniel
    Mukherjee, Pratyay
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, ACNS 2022, 2022, 13269 : 626 - 642
  • [4] Tight Multi-User Security Bound of DbHtS
    Datta, Nilanjan
    Dutta, Avijit
    Nandi, Mridul
    Talnikar, Suprita
    IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2023, 2023 (01) : 192 - 223
  • [5] On the Multi-user Security of Short Schnorr Signatures with Preprocessing
    Blocki, Jeremiah
    Lee, Seunghoon
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2022, PT II, 2022, 13276 : 614 - 643
  • [6] Security of BLS and BGLS signatures in a multi-user setting
    Lacharite, Marie-Sarah
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2018, 10 (01): : 41 - 58
  • [7] Security of BLS and BGLS signatures in a multi-user setting
    Marie-Sarah Lacharité
    Cryptography and Communications, 2018, 10 : 41 - 58
  • [8] Tight Multi-user Security of Ascon and Its Large Key Extension
    Chakraborty, Bishwajit
    Dhar, Chandranan
    Nandi, Mridul
    INFORMATION SECURITY AND PRIVACY, PT I, ACISP 2024, 2024, 14895 : 57 - 76
  • [9] The Multi-user Security of GCM, Revisited: Tight Bounds for Nonce Randomization
    Viet Tung Hoang
    Tessaro, Stefano
    Thiruvengadam, Aishwarya
    PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18), 2018, : 1429 - 1440
  • [10] Almost Tight Multi-user Security Under Adaptive Corruptions & Leakages in the Standard Model
    Han, Shuai
    Liu, Shengli
    Gu, Dawu
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2023, PT III, 2023, 14006 : 132 - 162