Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case 论文
2002Lecture notes in computer science引用 329
Cryptography and Data SecurityCryptographic Implementations and SecurityComplexity and Algorithms in Graphs
详细信息
- 发表期刊/会议
- Lecture notes in computer science
- 发表日期
- 2002-01-01
- 发表年份
- 2002
关键词
Cryptography and Data SecurityCryptographic Implementations and SecurityComplexity and Algorithms in Graphs