Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
37
views
11
references
Top references
cited by
17
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,523
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology - CRYPTO 2003
Luby-Rackoff: 7 Rounds Are Enough for 2 n(1 − ε) Security
other
Author(s):
Jacques Patarin
Publication date
(Print):
2003
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
The Criminology, Victimology and Security Journal
Most cited references
11
Record
: found
Abstract
: not found
Book Chapter
: not found
Indistinguishability of Random Systems
Ueli Maurer
(2002)
0
comments
Cited
32
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Ciphers with Arbitrary Finite Domains
John Black
,
Phillip Rogaway
(2002)
0
comments
Cited
21
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations
Ueli Maurer
,
Krzysztof Pietrzak
(2003)
0
comments
Cited
16
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2003
Pages
: 513-529
DOI:
10.1007/978-3-540-45146-4_30
SO-VID:
4f79bbba-9cad-4aae-a2a6-dc013d2b4d9c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Factoring Large Numbers with the TWIRL Device
pp. 600
Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication
pp. 44
Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases
pp. 61
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
pp. 78
Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret
pp. 96
On Cryptographic Assumptions and Challenges
pp. 110
Scalable Protocols for Authenticated Group Key Exchange
pp. 126
Practical Verifiable Encryption and Decryption of Discrete Logarithms
pp. 145
Extending Oblivious Transfers Efficiently
pp. 162
Algebraic Attacks on Combiners with Memory
pp. 212
A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem
pp. 226
The Impact of Decryption Failures on the Security of NTRU Encryption
pp. 247
Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption
pp. 265
Universal Composition with Joint State
pp. 282
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More
pp. 316
On Deniability in the Common Reference String and Random Oracle Model
pp. 349
Torus-Based Cryptography
pp. 383
Multipurpose Identity-Based Signcryption
pp. 400
SIGMA: The ‘SIGn-and-MAc’ Approach to Authenticated Diffie-Hellman and Its Use in the IKE Protocols
pp. 482
A Tweakable Enciphering Mode
pp. 513
Luby-Rackoff: 7 Rounds Are Enough for 2 n(1 − ε) Security
pp. 565
Relaxing Chosen-Ciphertext Security
pp. 583
Password Interception in a SSL/TLS Channel
Similar content
4,523
Magnetoresistance in LuBi and YBi semimetals due to nearly perfect carrier compensation
Authors:
Piotr Wiśniewski
,
Orest Pavlosiuk
,
Przemysław Swatek
…
Optimization Design and Asymptotic Analysis of Systematic Luby Transform Codes Over BIAWGN Channels
Authors:
Shengkai Xu
,
Dazhuan Xu
Vision-Based UAV Navigation in Orchards**This work is supported in part by NSF Awards 1111638, 1525045 and the MnDrive initiative. The authors thank Professors Emily Hoover, Cindy Tong and James Luby from the Department of Horticultural Science, University of Minnesota for access to their orchards and useful discussions. We also thank Dr. Krishna Doddapaneni for his help with the experiments.
Authors:
Volkan Isler
,
Nikolaos Stefas
,
Haluk Bayram
See all similar
Cited by
17
Security of Random Feistel Schemes with 5 or More Rounds
Authors:
Jacques Patarin
Format-Preserving Encryption
Authors:
Mihir Bellare
,
Thomas Ristenpart
,
Phillip Rogaway
…
The “Coefficients H” Technique
Authors:
Jacques Patarin
See all cited by