Yan-Cheng Chang, Chun-Yun Hsiao  Home/Search
Context
Related
| sinica.edu.tw/~cjlu/pub/owp.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sinica.edu.tw/~cjlu/paper (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We know that trapdoor permutations can be used to construct all kinds of basic cryptographic primitives, including trapdoor functions, public-key encryption, private information retrieval, oblivious transfer, key agreement, and those known to be equivalent to one-way functions such as digital signature, private-key encryption, bit commitment, pseudo-random generator and pseudo-random functions. On the other hand, trapdoor functions are not as powerful as trapdoor permutations, so the structural ... (Update)
Active bibliography (related documents): More All
0.8: Bounds on the Efficiency of Generic Cryptographic.. - Gennaro, Gertner, Katz, .. (Correct)
0.6: Bounds on the Efficiency of Encryption and Digital Signatures - Gennaro, Gertner, Katz (2002) (Correct)
0.6: Lower Bounds on the Efficiency of Encryption and Digital.. - Gennaro, Gertner, Katz (2003) (Correct)
Similar documents based on text: More All
0.6: On the Power of Claw-Free Permutations - Dodis, Reyzin (2002) (Correct)
0.6: Invariant Signatures and Non-Interactive Zero-Knowledge.. - Goldwasser, Ostrovsky (Correct)
0.5: How to Sign Given Any Trapdoor Permutation - Bellare, Micali (1992) (Correct)
BibTeX entry: (Update)
@misc{ chang-impossibilities,
author = "Yan-Cheng Chang and Chun-Yun Hsiao",
title = "On the Impossibilities of Basing One-Way Permutations on Central Cryptographic
Primitives",
url = "citeseer.ist.psu.edu/567515.html" }
Citations (may not include all citations):1529 A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978
339 Theory and applications of trapdoor functions (context) - Yao - 1982
174 Private information retrieval - Chor, Goldreich et al. - 1995
124 Bit commitment using pseudorandomness - Naor - 1991
100 Founding cryptography on oblivious transfer (context) - Kilian - 1988
95 Limits on the provable consequences of one-way permutations - Impagliazzo, Rudich - 1989
90 A pseudorandom generator from any one-way function - astad, Impagliazzo et al. - 1999
90 IEEE Transactions on Information Theory (context) - Die, Hellman et al. - 1976
81 Replication is not needed: single database (context) - Kushilevitz, Ostrovsky - 1997
79 One-way functions are essential for complexity based cryptog.. (context) - Impagliazzo, Luby - 1989
53 One-way functions are necessary and sucient for secure signa.. (context) - Rompel - 1990
29 Finding collisions on a one-way street: can secure hash func.. (context) - Simon - 1998
22 One-way functions are essential for single-server private in.. - Beimel, Ishai et al. - 1999
20 Limits on the provable consequences of one-way functions - Rudich - 1988
17 The relationship between public key encryption and oblivious.. (context) - Gertner, Kannan et al. - 2000
10 A dual version of Reimer's inequality and a proof of Rudich'.. (context) - Kahn, Saks et al. - 2000
10 The use of interaction in public cryptosystems (context) - Rudich - 1991
10 One-way trapdoor permutations are sucient for non-trivial si.. (context) - Kushilevitz, Ostrovsky - 2000
8 the impossibility of basing trapdoor functions on trapdoor p.. (context) - Gertner, Malkin et al. - 2001
8 Lower bounds on the eciency of generic cryptographic constru.. (context) - Gennaro, Trevisan - 2000
7 the impossibility of constructing non-interactive statistica.. - Fischlin - 2002
6 Many-to-one trapdoor functions and their relation to public-.. (context) - Bellare, Halevi et al. - 1998
4 Limits on the eciency of one-way permutation-based hash func.. (context) - Kim, Simon et al. - 1999
1 Single database private information retrieval implies oblivi.. (context) - Di Crescenzo, Malkin et al. - 2000
Documents on the same site (http://www.iis.sinica.edu.tw/~cjlu/paper.html): More
A Deterministic Approximation Algorithm for a Minmax Integer.. - Lu (1999) (Correct)
Deterministic Hypergraph Coloring and Its Applications - Lu (1998) (Correct)
Derandomizing Arthur-Merlin Games under Uniform Assumptions - Lu (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC