Decision Oracles are Equivalent to Matching Oracles
- 29 October 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 276-289
- https://doi.org/10.1007/3-540-49162-7_22
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A new public-key cryptosystem as secure as factoringLecture Notes in Computer Science, 1998
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attackLecture Notes in Computer Science, 1998
- Easy come — Easy go divisible cashLecture Notes in Computer Science, 1998
- Towards realizing random oracles: Hash functions that hide all partial informationLecture Notes in Computer Science, 1997
- “Indirect discourse proofs”: Achieving efficient Fair Off-Line e-cashPublished by Springer Nature ,1996
- An Efficient Divisible Electronic Cash SchemeLecture Notes in Computer Science, 1995
- A uniform-complexity treatment of encryption and zero-knowledgeJournal of Cryptology, 1993
- Non-malleable cryptographyPublished by Association for Computing Machinery (ACM) ,1991
- Advances in Cryptology — EUROCRYPT ’90Lecture Notes in Computer Science, 1991
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985