Aggelos Kiayias, Moti Yung  Home/Search
Context Related
| eccc.unitrier.de/ecccrepor...Paper.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: eccc.unitrier.de/pub/ecc...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the decoding problem of Reed-Solomon Codes (aka: the Polynomial Reconstruction Problem -- PR) from a cryptographic hardness perspective. First, following the standard methodology for constructing cryptographically strong primitives, we formulate a decisional intractability assumption related to the PR problem. Then, based on this assumption we show: (i) hardness of partial information extraction: an adversary who wishes to predict the value of some computable function on a... (Update)
Cited by: More
Cryptography from Anonymity - Yuval Ishai Eyal (Correct)
Invited Survey Paper - Directions In Polynomial (Correct)
Cryptanalysis of the Repaired Public-key Encryption Scheme Based.. - Coron (2003) (Correct)
Active bibliography (related documents): More All
0.3: Secure Games with Polynomial Expressions - Kiayias, Yung (2001) (Correct)
0.0: Noisy Polynomial Interpolation and Noisy Chinese Remaindering - Bleichenbacher, Nguyen (2000) (Correct)
0.0: One-way Functions are Essential for Single-Server.. - Beimel, Ishai.. (1999) (Correct)
Similar documents based on text: More All
0.4: Cryptanalysis of the Polynomial Reconstruction Based.. - Kiayias, Yung (2003) (Correct)
0.3: Cryptanalyzing the Polynomial-Reconstruction based Public-Key.. - Kiayias, Yung (2004) (Correct)
0.3: Constructions of Codes from Number Fields - Guruswami (2001) (Correct)
Related documents from co-citation: More All
8: Error Correction of Algebraic Block Codes (context) - Berlekamp, Welch
8: Cryptanalysis of a public-key encryption scheme based on the polynomial reconstr.. - Coron - 2003
7: Oblivious Transfer and Polynomial Evaluation (context) - Naor, Pinkas - 1998
BibTeX entry: (Update)
A. Kiayias and M. Yung, Cryptographic hardness based on the decoding of Reed-Solomon codes with applications, Proceedings of ICALP 2002, LNCS 2380, pp 232-243, 2002. http://citeseer.ist.psu.edu/kiayias02cryptographic.html More
@article{ kiayias02cryptographic,
author = "Aggelos Kiayias and Moti Yung",
title = "Cryptographic Hardness based on the Decoding of Reed-Solomon Codes with Applications",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
number = "017",
year = "2002",
url = "citeseer.ist.psu.edu/kiayias02cryptographic.html" }
Citations (may not include all citations):860 The Theory of Error Correcting Codes (context) - MacWilliams, Sloane - 1977
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali et al. - 1984
339 Theory and applications of trapdoor functions (context) - Yao - 1982
182 Algebraic Coding Theory (context) - Berlekamp - 1968
140 Decoding of Reed Solomon Codes beyond the Error-Correction B.. - Sudan - 1997
124 Bit Commitment Using Pseudorandomness - Naor - 1991
114 Improved Decoding of Reed-Solomon and Algebraic-Geometric Co.. - Guruswami, Sudan - 1998
102 Oblivious Transfer and Polynomial Evaluation (context) - Naor, Pinkas - 1999
98 Error Correction of Algebraic Block Codes (context) - Berlekamp, Welch - 1986
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996
85 Construction of a pseudo-random generator from any one-way f.. - Hastad, Impagliazzo et al. - 1999
65 Learning Polynomials with Queries: The Highly Noisy Case - Goldreich, Sudan et al. - 1995
63 An Efficient Probabilistic Public-Key Encryption Scheme Whic.. (context) - Blum, Goldwasser - 1985
55 Number-theoretic Constructions of Efficient Pseudorandom Fun.. - Naor, Reingold - 1997
40 Foundations of Cryptography: Fragments of a Book - Goldreich - 1998
32 Complete Characterization of Security Notions for Probabilis.. (context) - Katz, Yung - 2000
19 A note on computational indistinguishability - Goldreich - 1990
19 Non-Interactive and information-theoretic secure verifiable .. (context) - Pedersen - 1992
17 Password Hardening based on Keystroke Dynamics (context) - Monrose, Reiter et al. - 1999
3 Noisy Polynomial Interpolation and Noisy Chinese Remainderin.. (context) - Bleichenbacher, Nguyen - 2000
The graph only includes citing articles where the year of publication is known.
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