Hunting and Gathering – Verifiable Random Functions from Standard Assumptions with Short Proofs

被引:0
|
作者
Kohl, Lisa [1 ]
机构
[1] Karlsruhe Institute of Technology, Karlsruhe, Germany
关键词
921.1; Algebra;
D O I
暂无
中图分类号
学科分类号
摘要
35
引用
收藏
页码:408 / 437
相关论文
共 20 条
  • [1] Verifiable Random Functions from Standard Assumptions
    Hofheinz, Dennis
    Jager, Tibor
    THEORY OF CRYPTOGRAPHY, TCC 2016-A, PT I, 2016, 9562 : 336 - 362
  • [2] Verifiable random functions from weaker assumptions
    Jager, Tibor
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015, 9015 : 121 - 143
  • [3] Verifiable Random Functions from Weaker Assumptions
    Jager, Tibor
    THEORY OF CRYPTOGRAPHY (TCC 2015), PT II, 2015, 9015 : 121 - 143
  • [4] A verifiable random function with short proofs and keys
    Dodis, Y
    Yampolskiy, A
    PUBLIC KEY CRYPTOGRAPHY - PKC 2005, 2005, 3386 : 416 - 431
  • [5] Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
    Nir Bitansky
    Journal of Cryptology, 2020, 33 : 459 - 493
  • [6] Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
    Bitansky, Nir
    THEORY OF CRYPTOGRAPHY, TCC 2017, PT II, 2017, 10678 : 567 - 594
  • [7] Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
    Bitansky, Nir
    JOURNAL OF CRYPTOLOGY, 2020, 33 (02) : 459 - 493
  • [8] Verifiable Random Functions from (Leveled) Multilinear Maps
    Liang, Bei
    Li, Hongda
    Chang, Jinyong
    CRYPTOLOGY AND NETWORK SECURITY, CANS 2015, 2015, 9476 : 129 - 143
  • [9] Constrained Verifiable Random Functions from Indistinguishability Obfuscation
    Liang, Bei
    Li, Hongda
    Chang, Jinyong
    PROVABLE SECURITY, PROVSEC 2015, 2015, 9451 : 43 - 60
  • [10] Verifiable Random Functions from Identity-Based Key Encapsulation
    Abdalla, Michel
    Catalano, Dario
    Fiore, Dario
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2009, 2009, 5479 : 554 - +