DL-Extractable UC-Commitment Schemes-Reference-Cited by-同舟云学术

DL-Extractable UC-Commitment Schemes

Published:2019 Issue: Volume: Page:385-405
ISSN:0302-9743
Container-title:Applied Cryptography and Network Security
language:
Short-container-title:

Author:

Abdolmaleki Behzad,Baghery Karim,Lipmaa Helger,Siim Janno,Zając Michał

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-21568-2_19

Reference25 articles.

1. Lecture Notes in Computer Science;M Abdalla,2015

2. Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: 45th FOCS, pp. 186–195 (2004)

3. Lecture Notes in Computer Science;M Belenkiy,2008

4. Ben-Sasson, E., Chiesa, A., Green, M., Tromer, E., Virza, M.: Secure sampling of public parameters for succinct zero knowledge proofs. In: 2015 IEEE Symposium on Security and Privacy, pp. 287–304 (2015)

5. Lecture Notes in Computer Science;O Blazy,2013

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Flexible and Scalable Malicious Secure Aggregation Protocol for Federated Learning;IEEE Transactions on Information Forensics and Security;2024

2. A bivariate polynomial-based cryptographic hard problem and its applications;Designs, Codes and Cryptography;2023-04-29

3. Scalable Decentralized Privacy-Preserving Usage-Based Insurance for Vehicles;IEEE Internet of Things Journal;2021-03-15

4. A Non-interactive Shuffle Argument with Low Trust Assumptions;Topics in Cryptology – CT-RSA 2020;2020

5. A Framework for UC-Secure Commitments from Publicly Computable Smooth Projective Hashing;Cryptography and Coding;2019