Delay Encryption
暂无分享,去创建一个
[1] Vipul Goyal,et al. Reducing Trust in the PKG in Identity Based Cryptosystems , 2007, CRYPTO.
[2] Wouter Castryck,et al. CSIDH on the surface , 2020, IACR Cryptol. ePrint Arch..
[3] Giulio Malavolta,et al. Homomorphic Time-Lock Puzzles and Applications , 2019, IACR Cryptol. ePrint Arch..
[4] David Jao,et al. Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies , 2011, J. Math. Cryptol..
[5] Frederik Vercauteren,et al. CSI-FiSh: Efficient Isogeny based Signatures through Class Group Computations , 2019, IACR Cryptol. ePrint Arch..
[6] Christophe Petit,et al. Faster Algorithms for Isogeny Problems Using Torsion Point Images , 2017, ASIACRYPT.
[7] Nir Bitansky,et al. Time-Lock Puzzles from Randomized Encodings , 2016, IACR Cryptol. ePrint Arch..
[8] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..
[9] Dan Boneh,et al. Verifiable Delay Functions , 2018, IACR Cryptol. ePrint Arch..
[10] Steven D. Galbraith,et al. SeaSign: Compact isogeny signatures from class group actions , 2019, IACR Cryptol. ePrint Arch..
[11] Craig Costello,et al. Efficient Algorithms for Supersingular Isogeny Diffie-Hellman , 2016, CRYPTO.
[12] Kristin E. Lauter,et al. On the quaternion -isogeny path problem , 2014, LMS J. Comput. Math..
[13] Christophe Petit,et al. Weak instances of SIDH variants under improved torsion-point attacks , 2020, IACR Cryptol. ePrint Arch..
[14] Daniel J. Bernstein,et al. Modular exponentiation via the explicit Chinese remainder theorem , 2007, Math. Comput..
[15] Luca De Feo,et al. Verifiable Delay Functions from Supersingular Isogenies and Pairings , 2019, IACR Cryptol. ePrint Arch..
[16] Tanja Lange,et al. CSIDH: An Efficient Post-Quantum Commutative Group Action , 2018, IACR Cryptol. ePrint Arch..
[17] Joost Renes. Computing isogenies between Montgomery curves using the action of (0, 0) , 2017, IACR Cryptol. ePrint Arch..
[18] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[19] Brent Waters,et al. Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[20] Christophe Petit,et al. SÉTA: Supersingular Encryption from Torsion Attacks , 2019, IACR Cryptol. ePrint Arch..
[21] Matthew K. Franklin,et al. Efficient generation of shared RSA keys , 2001, JACM.
[22] Wouter Castryck,et al. Rational Isogenies from Irrational Endomorphisms , 2020, IACR Cryptology ePrint Archive.
[23] Ariel Gabizon,et al. plookup: A simplified polynomial protocol for lookup tables , 2020, IACR Cryptol. ePrint Arch..
[24] Matthew Green,et al. ZEXE: Enabling Decentralized Private Computation , 2020, 2020 IEEE Symposium on Security and Privacy (SP).
[25] Kristin E. Lauter,et al. Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions , 2018, EUROCRYPT.
[26] Krzysztof Pietrzak,et al. Simple Verifiable Delay Functions , 2018, IACR Cryptol. ePrint Arch..
[27] Ronald L. Rivest,et al. Time-lock Puzzles and Timed-release Crypto , 1996 .
[28] Benjamin Wesolowski,et al. Efficient Verifiable Delay Functions , 2019, Journal of Cryptology.
[29] Dan Boneh,et al. Supersingular Curves With Small Non-integer Endomorphisms , 2019, ArXiv.