Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(5)
Elliptic Curve
Probability Distribution
Provable Security
Random Oracle
Security Proof
Subscribe
Academic
Publications
SpaceEfficient Kleptography Without Random Oracles
SpaceEfficient Kleptography Without Random Oracles,10.1007/9783540773702_8,Adam Young,Moti M. Yung
Edit
SpaceEfficient Kleptography Without Random Oracles
(
Citations: 1
)
BibTex

RIS

RefWorks
Download
Adam Young
,
Moti M. Yung
In the past, hiding asymmetric backdoors inside cryptosystems required a
random oracle
assumption (idealization) as “randomizers” of the hidden channels. The basic question left open is whether cryptography itself based on traditional hardness assumption(s) alone enables “internal randomized channels” that enable the embedding of an asymmetric backdoor inside another cryptosystem while retaining the security of the cryptosystem and the backdoor (two security proofs in one system). This question translates into the existence of kleptographic channels without the idealization of
random oracle
functions. We therefore address the basic problem of controlling the
probability distribution
over information (i.e., the kleptogram) that is hidden within the output of a cryptographic system. We settle this question by presenting an
elliptic curve
asymmetric backdoor construction that solves this problem. As an example, we apply the construction to produce a provably secure asymmetric backdoor in SSL. The construction is general and applies to many other kleptographic settings as well.
Conference:
Information Hiding
, pp. 112129, 2007
DOI:
10.1007/9783540773702_8
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.springerlink.com
)
(
adsabs.harvard.edu
)
(
www.informatik.unitrier.de
)
(
dx.doi.org
)
More »
Citation Context
(1)
...Another example is a highly spaceefficient public key stegosystem [
17
]...
...An asymmetric backdoor in SSL was presented in [
27
] that employs Kaliski’s elliptic curve pseudorandom bit generator [14]...
...Indeed this key exchange problem was addressed in [
27
]...
...The partial covert key exchange solution in [
27
] is therefore illsuited for a backdoor in RSA key generation since the backdoor would only take effect with probability very close to 1/2 when a key pair is generated...
...Below we review algorithms from [
27
] (which are built on [14]) that encode/decode points using fixedlength bit strings...
Adam Young
,
et al.
Kleptography from Standard Assumptions and Applications
Sort by:
Citations
(1)
Kleptography from Standard Assumptions and Applications
Adam Young
,
Moti Yung
Conference:
Security and Cryptography for Networks  SCN
, pp. 271290, 2010