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
41
views
8
references
Top references
cited by
40
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,678
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
other
Author(s):
Jesper Buus Nielsen
Publication date
(Online):
September 13 2002
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
Orthopedics
Most cited references
8
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Universally composable security: a new paradigm for cryptographic protocols
R. Canetti
(2024)
0
comments
Cited
235
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Security and Composition of Multiparty Cryptographic Protocols
Ran Canetti
(2000)
0
comments
Cited
154
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Optimal asymmetric encryption
Mihir Bellare
,
Phillip Rogaway
(1995)
0
comments
Cited
114
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2002
Publication date (Online):
September 13 2002
Pages
: 111-126
DOI:
10.1007/3-540-45708-9_8
SO-VID:
5864a395-9515-4073-b6db-720ddbf0c411
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Essential Algebraic Structure within the AES
pp. 17
Blockwise-Adaptive Attackers Revisiting the (In)Security of Some Provably Secure Encryption Modes: CBC, GEM, IACBC
pp. 31
Tweakable Block Ciphers
pp. 47
The LSD Broadcast Encryption Scheme
pp. 77
Provably Secure Steganography
pp. 93
Flaws in Applying Proof Methodologies to Signature Schemes
pp. 111
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
pp. 127
On the Security of RSA Encryption in TLS
pp. 143
Security Analysis of IKE’s Signature-Based Key-Exchange Protocol
pp. 162
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks
pp. 178
On 2-Round Secure Multiparty Computation
pp. 194
Private Computation — k-Connected versus 1-Connected Networks
pp. 210
Analysis and Improvements of NTRU Encryption Paddings
pp. 226
Universal Padding Schemes for RSA
pp. 242
Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
pp. 257
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors
pp. 272
Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups
pp. 304
(Not So) Random Shuffles of RC4
pp. 320
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
pp. 336
Supersingular Abelian Varieties in Cryptology
pp. 369
Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2
pp. 385
Threshold Password-Authenticated Key Exchange
pp. 401
A Threshold Pseudorandom Function Construction and Its Applications
pp. 417
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products
pp. 433
Hidden Number Problem with the Trace and Bit Security of XTR and LUC
pp. 449
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security
pp. 481
Deniable Ring Authentication
pp. 499
SiBIR: Signer-Base Intrusion-Resilient Signatures
pp. 515
Cryptanalysis of Stream Ciphers with Linear Masking
pp. 533
The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers
pp. 549
A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction
pp. 565
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks
pp. 581
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
pp. 597
Unique Signatures and Verifiable Random Functions from the DH-DDH Separation
pp. 613
Security Proof for Partial-Domain Hash Signature Schemes
Similar content
1,678
Marsile Ficin et le Commentaire de Pléthon sur les Oracles chaldaïques
Authors:
From the Chaldean Oracles to the Corpus Dionysiacum: theurgy between the third and sixth centuries
Authors:
Charles M. Stang
Optimization with Demand Oracles
Authors:
Ashwinkumar Badanidiyuru
,
Shahar Dobzinski
,
Sigal Oren
See all similar
Cited by
40
A Forward-Secure Public-Key Encryption Scheme
Authors:
Ran Canetti
,
Shai Halevi
,
Jonathan Katz
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
Authors:
Jens Groth
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
Authors:
Ueli Maurer
,
Renato Renner
,
Clemens Holenstein
See all cited by