Polynomial reconstruction based cryptography
Aggelos Kiayias,Moti Yung +1 more
- pp 129-133
Reads0
Chats0
TLDR
A short overview of recent works on the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) and the novel applications that were enabled due to this development.Abstract:
Cryptography and Coding Theory are closely knitted in many respects Recently, the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) was suggested as an intractability assumption upon which the security of cryptographic protocols can be based This has initiated a line of research that exploited the rich algebraic structure of the problem and related subproblems of which in the cryptographic setting Here we give a short overview of recent works on the subject and the novel applications that were enabled due to this developmentread more
Citations
More filters
Book ChapterDOI
Bringing semantics to web services: the OWL-S approach
David Martin,Massimo Paolucci,Sheila A. McIlraith,Mark Burstein,Drew McDermott,Deborah L. McGuinness,Bijan Parsia,Terry R. Payne,Marta Sabou,Monika Solanki,Naveen Srinivasan,Katia Sycara +11 more
TL;DR: This paper shows how to use OWL-S in conjunction with Web service standards, and explains and illustrates the value added by the semantics expressed in OWl-S.
Book ChapterDOI
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
TL;DR: Public-key and symmetric-key cryptosystems that provide security for key-dependent messages and enjoy circular security and a pseudorandom generator that can be computed by a circuit of n ·polylog(n) size are constructed.
Book ChapterDOI
An Efficient Signature Scheme from Bilinear Pairings and Its Applications
TL;DR: This paper proposes a new short signature scheme from the bilinear pairings that unlike BLS, uses general cryptographic hash functions such as SHA-1 or MD5, and does not require special hash functions.
Book ChapterDOI
Pushing the limits: a very compact and a threshold implementation of AES
TL;DR: A very compact hardware implementation of AES-128, which requires only 2400 GE, is described, to the best of the knowledge the smallest implementation reported so far and is still susceptible to some sophisticated attacks having enough number of measurements.
Book ChapterDOI
Faster addition and doubling on elliptic curves
Daniel J. Bernstein,Tanja Lange +1 more
TL;DR: An extensive comparison of different forms of elliptic curves and different coordinate systems for the basic group operations (doubling, mixed addition, non-mixed addition, and unified addition) as well as higher-level operations such as multi-scalar multiplication.
References
More filters
Journal ArticleDOI
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
TL;DR: To the best of the knowledge, this is the first efficient (i.e., polynomial time bounded) algorithm which provides error recovery capability beyond the error-correction bound of a code for any efficient code.
Proceedings ArticleDOI
Oblivious transfer and polynomial evaluation
Moni Naor,Benny Pinkas +1 more
TL;DR: The efficiency of the new OT protocols makes them useful for a variety of applications, including oblivious sampling which can be used to securely compare the sizes of web search engines, protocols for privately solving the list intersection problem and for mutually authenticated key exchange based on (possibly weak) passwords, and protocols for anonymity preserving web usage metering.
Proceedings ArticleDOI
Improved decoding of Reed-Solomon and algebraic-geometric codes
Venkatesan Guruswami,Madhu Sudan +1 more
TL;DR: An improved list decoding algorithm for decoding Reed-Solomon codes and alternant codes and algebraic-geometric codes is presented, including a solution to a weighted curve fitting problem, which is of use in soft-decision decoding algorithms for Reed- Solomon codes.
Proceedings ArticleDOI
Password hardening based on keystroke dynamics
TL;DR: This work presents a novel approach to improving the security of passwords that automatically adapts to gradual changes in a user's typing patterns while maintaining the same hardened password across multiple logins, for use in file encryption or other applications requiring a longterm secret key.