Publisher
Springer Berlin Heidelberg
Reference39 articles.
1. Barak, B., Lindell, Y.: Strict Polynomial-Time in Simulation and Extraction. In: 34th STOC, pp. 484–493 (2002)
2. Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: 1st ACM Conf. on Computer and Communications Security, pp. 62–73 (1993)
3. Blum, M.: How to prove a Theorem So No One Else Can Claim It. In: Proc. of the International Congress of Mathematicians, Berekeley, California, USA, pp. 1444–1451 (1986)
4. Blum, M.: Coin Flipping by Telephone. In: Crypto 1981, ECE Report 82-04, ECE Dept., UCSB, pp. 11–15 (1982)
5. Blum, M., Feldman, P., Micali, S.: Non-Interactive Zero-Knowledge and Its Applications. In: 20th STOC, pp. 103–112 (1988)
Cited by
100 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Achieving Third-party Deniability in Signature-based Credential Systems;2024 IEEE 48th Annual Computers, Software, and Applications Conference (COMPSAC);2024-07-02
2. Verifiable Encryption from MPC-in-the-Head;IACR Communications in Cryptology;2024-04-09
3. Approximate Lower Bound Arguments;Lecture Notes in Computer Science;2024
4. Witness Semantic Security;Lecture Notes in Computer Science;2024
5. Secure Multiparty Computation with Identifiable Abort via Vindicating Release;Lecture Notes in Computer Science;2024