Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings-Reference-Cited by-同舟云学术

Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings

Published:2015 Issue: Volume: Page:305-325
ISSN:0302-9743
Container-title:Computer Security -- ESORICS 2015
language:
Short-container-title:

Author:

Benhamouda Fabrice,Krenn Stephan,Lyubashevsky Vadim,Pietrzak Krzysztof

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-24174-6_16

Reference45 articles.

1. Lecture Notes in Computer Science;G Asharov,2012

2. Lecture Notes in Computer Science;F Benhamouda,2014

3. Boyar, J., Damgård, I., Peralta, R.: Short non-interactive cryptographic proofs. J. Cryptology 13(4), 449–472 (2000)

4. Lecture Notes in Computer Science;M Bellare,1993

5. Bangerter, E., Ghadafi, E., Krenn, S., Sadeghi, A.-R., Schneider, T., Smart, N.P., Tsay, J.-K., Warinschi, B.: Final Report on Unified Theoretical Framework of Efficient Zero-Knowledge Proofs of Knowledge. CACE Project Deliverable (2009)

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

1. Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems;Lecture Notes in Computer Science;2024

2. On remote electronic voting with both coercion resistance and cast-as-intended verifiability;Journal of Information Security and Applications;2023-08

3. Compressed Zero-Knowledge Proofs for Lattice-Based Accumulator;The Computer Journal;2023-03-10

4. Privacy-Preserving Social Media With Unlinkability and Disclosure;IEEE Access;2023

5. PrivData Network: A Privacy-preserving on-chain Data Factory and Trading Market;IEEE Transactions on Dependable and Secure Computing;2023