Feistel Networks Made Public, and Applications
- 1 January 2007
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Luby-Rackoff Ciphers from Weak Round Functions?Published by Springer Science and Business Media LLC ,2006
- On the Relation Between the Ideal Cipher and the Random Oracle ModelsLecture Notes in Computer Science, 2006
- A Verifiable Random Function with Short Proofs and KeysLecture Notes in Computer Science, 2005
- Efficient Construction of (Distributed) Verifiable Random FunctionsLecture Notes in Computer Science, 2002
- Unique Signatures and Verifiable Random Functions from the DH-DDH SeparationLecture Notes in Computer Science, 2002
- Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are EquivalentPublished by Springer Science and Business Media LLC ,2001
- Constructing VIL-MACs from FIL-MACs: Message Authentication under Weakened AssumptionsLecture Notes in Computer Science, 1999
- The Exact Security of Digital Signatures-How to Sign with RSA and RabinLecture Notes in Computer Science, 1996
- Optimal asymmetric encryptionLecture Notes in Computer Science, 1995
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988