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
35
views
26
references
Top references
cited by
1
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,851
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Reproducible Circularly-Secure Bit Encryption: Applications and Realizations
other
Author(s):
Mohammad Hajiabadi
,
Bruce M. Kapron
Publication date
(Online):
August 1 2015
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
Reproducible research article collection
Most cited references
26
Record
: found
Abstract
: not found
Book Chapter
: not found
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Benny Applebaum
,
David W. Cash
,
Chris Peikert
…
(2009)
0
comments
Cited
65
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Deterministic and Efficiently Searchable Encryption
Mihir Bellare
,
Alexandra Boldyreva
,
Adam J. O’neill
(2007)
0
comments
Cited
62
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
Alexandra Boldyreva
,
Serge Fehr
,
Adam J. O’neill
(2008)
0
comments
Cited
41
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2015
Publication date (Online):
August 1 2015
Pages
: 224-243
DOI:
10.1007/978-3-662-47989-6_11
SO-VID:
90046f03-a131-459c-b655-94529163167a
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
pp. 23
Coded-BKW: Solving LWE Using Lattice Codes
pp. 43
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
pp. 63
Provably Weak Instances of Ring-LWE
pp. 95
Links Among Impossible Differential, Integral and Zero Correlation Linear Cryptanalysis
pp. 116
On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
pp. 141
Capacity and Data Complexity in Multidimensional Linear Attack
pp. 161
Observations on the SIMON Block Cipher Family
pp. 189
Tweaking Even-Mansour Ciphers
pp. 209
Multi-key Security: The Even-Mansour Construction Revisited
pp. 224
Reproducible Circularly-Secure Bit Encryption: Applications and Realizations
pp. 247
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
pp. 267
New Multilinear Maps Over the Integers
pp. 287
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
pp. 308
Indistinguishability Obfuscation from Compact Functional Encryption
pp. 329
Efficient Pseudorandom Functions via On-the-Fly Adaptation
pp. 351
The Iterated Random Permutation Problem with Applications to Cascade Encryption
pp. 368
The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC
pp. 388
An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security
pp. 413
Integral Cryptanalysis on Full MISTY1
pp. 433
New Attacks on Feistel Structures with Improved Memory Complexities
pp. 455
Known-Key Distinguisher on Full PRESENT
pp. 475
Key-Recovery Attack on the ASASA Cryptosystem with Expanding S-Boxes
pp. 493
Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance
pp. 518
Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More
pp. 538
Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
pp. 561
Cryptanalysis of the Co-ACD Assumption
pp. 601
A Quasipolynomial Reduction for Generalized Selective Decryption on Trees
pp. 623
Practical Free-Start Collision Attacks on 76-step SHA-1
pp. 643
Fast Correlation Attacks over Extension Fields, Large-Unit Linear Approximation and Cryptanalysis of SNOW 2.0
pp. 663
Cryptanalysis of Full Sprout
pp. 683
Higher-Order Differential Meet-in-the-middle Preimage Attacks on SHA-1 and BLAKE
pp. 705
Decaf: Eliminating Cofactors Through Point Compression
pp. 724
Actively Secure OT Extension with Optimal Overhead
pp. 742
Algebraic Decomposition for Probing Security
pp. 764
Consolidating Masking Schemes
Similar content
4,851
Comparison and Status of 32 Bit Backplane Bus Architectures
Authors:
K D Müller
Bias-preserving computation with the bit-flip code
Authors:
Shoichiro Tsutsui
,
Keita Kanno
Massive MIMO with 1-bit ADC
Authors:
Chiara Risi
,
Daniel Persson
,
Erik Larsson
See all similar
Cited by
1
Trapdoor Functions from the Computational Diffie-Hellman Assumption
Authors:
Sanjam Garg
,
Mohammad Hajiabadi
See all cited by