Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
22
views
12
references
Top references
cited by
18
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,449
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology — CRYPTO 2000
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
other
Author(s):
Ivan Damgård
,
Jesper Buus Nielsen
Publication date
(Online):
August 11 2000
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
Value-based Healthcare
Most cited references
12
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Adaptively secure multi-party computation
Ran Canetti
,
Uri Feige
,
Oded Goldreich
…
(1996)
0
comments
Cited
48
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
Oded Goldreich
,
Silvio Micali
,
Avi Wigderson
(1986)
0
comments
Cited
42
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Secure Computation
Silvio Micali
,
Phillip Rogaway
(1992)
0
comments
Cited
36
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2000
Publication date (Online):
August 11 2000
Pages
: 432-450
DOI:
10.1007/3-540-44598-6_27
SO-VID:
2441e848-983e-4d75-8e22-b4fffff8ec57
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
The XTR Public Key System
pp. 20
A Chosen-Ciphertext Attack against NTRU
pp. 55
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
pp. 74
Parallel Reducibility for Information-Theoretically Secure Computation
pp. 93
Optimistic Fair Secure Computation
pp. 112
A Cryptographic Solution to a Game Theoretic Problem
pp. 131
Differential Fault Attacks on Elliptic Curve Cryptosystems
pp. 147
Quantum Public-Key Cryptosystems
pp. 197
CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions
pp. 229
On the Exact Security of Full Domain Hash
pp. 236
Timed Commitments
pp. 255
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
pp. 271
Provably Secure Partially Blind Signatures
pp. 300
Fast Correlation Attacks through Reconstruction of Linear Polynomials
pp. 333
Long-Lived Broadcast Encryption
pp. 359
The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
pp. 376
On the Round Security of Symmetric-Key Cryptographic Primitives
pp. 413
Efficient Non-malleable Commitment Schemes
pp. 432
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
pp. 482
Linking Classical and Quantum Key Agreement: Is There “Bound Information”?
pp. 515
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
Similar content
4,449
White-tailed deer browse on an invasive shrub with extended leaf phenology meets assumptions of an apparent competition hypothesis
Authors:
Kylie L. Martinod
,
David L. Gorchov
Checking model assumptions
Authors:
Paddy Farrington
,
Heather Whitaker
,
Yonas Ghebremichael Weldeselassie
Macroeconomic and Policy Assumptions
Authors:
See all similar
Cited by
18
A Forward-Secure Public-Key Encryption Scheme
Authors:
Ran Canetti
,
Shai Halevi
,
Jonathan Katz
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
Authors:
Jesper Nielsen
Functional Encryption with Bounded Collusions via Multi-party Computation
Authors:
Sergey Gorbunov
,
Vinod Vaikuntanathan
,
Hoeteck Wee
See all cited by