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
44
views
30
references
Top references
cited by
14
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,153
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology - CRYPTO 2009
How to Encipher Messages on a Small Domain
other
Author(s):
Ben Morris
,
Phillip Rogaway
,
Till Stegers
Publication date
(Print):
2009
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
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
SAXS
Most cited references
30
Record
: found
Abstract
: not found
Article
: not found
Shuffling Cards and Stopping Times
David Aldous
,
Persi Diaconis
(1986)
0
comments
Cited
60
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Strong Stationary Times Via a New Form of Duality
Persi Diaconis
,
James Fill
(1990)
0
comments
Cited
53
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Trailing the Dovetail Shuffle to its Lair
Dave Bayer
,
Persi Diaconis
(1992)
0
comments
Cited
48
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2009
Pages
: 286-302
DOI:
10.1007/978-3-642-03356-8_17
SO-VID:
27da4d92-543b-415a-9516-5512bf84e4e8
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Reconstructing RSA Private Keys from Random Key Bits
pp. 18
Public-Key Cryptosystems Resilient to Key Leakage
pp. 317
Batch Binary Edwards
pp. 355
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
pp. 541
Privacy-Enhancing Auctions Using Rational Cryptography
pp. 36
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
pp. 55
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
pp. 108
Randomizable Proofs and Delegatable Anonymous Credentials
pp. 126
Computational Differential Privacy
pp. 143
Probabilistically Checkable Arguments
pp. 177
On the Amortized Complexity of Zero-Knowledge Protocols
pp. 192
Linear Algebra with Sub-linear Zero-Knowledge Arguments
pp. 286
How to Encipher Messages on a Small Domain
pp. 303
How to Hash into Elliptic Curves
pp. 374
Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
pp. 408
Improving the Security of Quantum Protocols via Commit-and-Open
pp. 445
How Risky Is the Random-Oracle Model?
pp. 577
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
pp. 595
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
pp. 654
Short and Stateless Signatures from the RSA Assumption
Similar content
2,153
Encipher of information on the basis of geometrical presentations
Authors:
,
Separate Enciphering of Correlated Messages for Confidentiality in Distributed Networks
Authors:
William Luh
,
Deepa Kundur
Efficient Classification of Enciphered SCADA Network Traffic in Smart Factory Using Decision Tree Algorithm
Authors:
Love Ahakonye
,
Cosmas Nwakanma
,
Jae-Min Lee
…
See all similar
Cited by
14
Format-Preserving Encryption
Authors:
Mihir Bellare
,
Thomas Ristenpart
,
Phillip Rogaway
…
An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
Authors:
Rodolphe Lampe
,
Jacques Patarin
,
Yannick Seurin
On Generalized Feistel Networks
Authors:
Viet Tung Hoang
,
Phillip Rogaway
See all cited by