Removing Erasures with Explainable Hash Proof Systems-Reference-Cited by-同舟云学术

Removing Erasures with Explainable Hash Proof Systems

Published:2017 Issue: Volume: Page:151-174
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Abdalla Michel,Benhamouda Fabrice,Pointcheval David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-54365-8_7

Reference33 articles.

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

2. Abdalla, M., Benhamouda, F., Pointcheval, D.: Removing erasures with explainable hash proof systems. Cryptology ePrint Archive, Report 2014/125 (2014). http://eprint.iacr.org/2014/125

3. Lecture Notes in Computer Science;M Abdalla,2009

4. Lecture Notes in Computer Science;B Barak,2005

5. Beaver, D.: Commodity-based cryptography (extended abstract). In: 29th ACM STOC, pp. 446–455. ACM Press, May 1997

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

1. Improving Practical UC-Secure Commitments based on the DDH Assumption;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2021

2. Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security;Advances in Cryptology – ASIACRYPT 2020;2020

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

4. Public-Key Encryption with Selective Opening Security from General Assumptions;Information Security and Cryptology;2019

5. Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions;Theory of Cryptography;2018