Making Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General Context
- 6 July 2001
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- Multi-prover interactive proofs: how to remove intractabilityPublished by Association for Computing Machinery (ACM) ,1988
- Non-interactive zero-knowledge and its applicationsPublished by Association for Computing Machinery (ACM) ,1988
- Subliminal-free Authentication and SignaturePublished by Springer Nature ,1988
- Demonstrating Possession of a Discrete Logarithm Without Revealing itPublished by Springer Nature ,1987
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- Codes Which Detect DeceptionBell System Technical Journal, 1974
- Communication Theory of Secrecy Systems*Bell System Technical Journal, 1949