Article

Free access

Rounding in lattices and its cryptographic applications

Authors:

Dan Boneh,

Ramarathnam VenkatesanAuthors Info & Claims

SODA '97: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Pages 675 - 682

Published: 05 January 1997 Publication History

PDF eReader

References

[1]

M. Ajt~i, ~Generating H~rd Instances for Lattice Problems", STOC 96.]]

Digital Library

Google Scholar

[2]

L. Bahai. On Lovasz' lattice reduction and the nearest lattice point problem. Combinatorica, 6:1-13, 1986.]]

Digital Library

Google Scholar

[3]

D. Boneh, Venk~tesan R., "Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes~, Proc. of Crypto, 1996.]]

Digital Library

Google Scholar

[4]

W. Diflie, Hellman E.M., "New directions in cryptography", IEEE. Trans. Inform. Theory, IT-22, No. 6, pp 644-654. (nov 1976)]]

Google Scholar

[5]

T. Elgamal, ~A public-key crypto system and a signature scheme baaed on Discrete Logarithms", IEEE Trans. on Info. Theory, IT-31, No 4, pp 469-472. (july]]

Google Scholar

[6]

Grotschel, Lovaaz L, Schrijex, "Geometric Algorithms and Combinatorial Optimization", Springer Verlag, 1988.]]

Google Scholar

[7]

R. impagliazzo, Naor M., "Efficient cryptographic schemes provably as secure as subset sum", Proc. FOGS 1989, pp. 236-241.]]

Google Scholar

[8]

D. Shmoys, ~Computing near-optimal solutions to combinatorial optimization problems," in Combinatorial Optimization: Papers from the DIMACS special year, Dimacs: Series in Discrete Mathematics and Theoretical Computer Science, Vol 20, 1995.]]

Google Scholar

[9]

N. Koblitz, "A course in Number Theory and Cryptography", Springer Verlag 1987.]]

Digital Library

Google Scholar

[10]

U. Maurer, "Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms", Proc. of Crypto, 1994, pp. 271-281.]]

Digital Library

Google Scholar

[11]

T. Okamoto, "Encryption and Authentication Schemes Based on Public Key Systems, Ph. D Thesis, The Univ. of Tokyo, (1988).]]

Google Scholar

[12]

K. Sakurai, Shizuya H, "Relationships among Computational powers of Breaking Discrete Log Cryptosysterns', Eurocrypt 95, pp 341-351.]]

Google Scholar

Cited By

View all

Chen JLiu MLi HShi HBao FMiller SZhou JAhn G(2015)Mind Your Nonces MovingProceedings of the 10th ACM Symposium on Information, Computer and Communications Security10.1145/2714576.2714587(609-614)Online publication date: 14-Apr-2015
https://dl.acm.org/doi/10.1145/2714576.2714587
Zhu YMa DHu CAhn GHu H(2014)Secure and efficient random functions with variable-length outputJournal of Network and Computer Applications10.1016/j.jnca.2014.07.03345:C(121-133)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1016/j.jnca.2014.07.033
Xu JHu LHuang ZPeng L(2014)Modular Inversion Hidden Number Problem RevisitedProceedings of the 10th International Conference on Information Security Practice and Experience - Volume 843410.1007/978-3-319-06320-1_39(537-551)Online publication date: 5-May-2014
https://dl.acm.org/doi/10.1007/978-3-319-06320-1_39
Show More Cited By

Index Terms

Rounding in lattices and its cryptographic applications

Recommendations

Trapdoors for Ideal Lattices with Applications
Information Security and Cryptology
Abstract
There is a lack of more complicated ideal-lattice-based cryptosystems which require the use of lattice trapdoors, for the reason that currently known trapdoors are either only applicable to general lattices or not well-studied in the ring setting. ...
Extreme fuzzy ideals and its applications on De Morgan residuated lattices

The variety of De Morgan residuated lattices includes important subvarieties of residuated lattices such as Boolean algebras, MV-algebras, BL-algebras, Stonean residuated lattices, MTL-algebras and involution residuated lattices (see L.C. Holdon [7]). X. ...
Identity-based signcryption from lattices

Signcryption as a cryptographic primitive can carry out signature and encryption simultaneously at a remarkably reduced cost. Identity-based cryptography is more convenient than public key infrastructure-based cryptography in certificate management. As a ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SODA '97: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

January 1997

788 pages

ISBN:0898713900

Chairman:
Michael Saks

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 05 January 1997

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
385
Total Downloads

Downloads (Last 12 months)48
Downloads (Last 6 weeks)9

Reflects downloads up to 01 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chen JLiu MLi HShi HBao FMiller SZhou JAhn G(2015)Mind Your Nonces MovingProceedings of the 10th ACM Symposium on Information, Computer and Communications Security10.1145/2714576.2714587(609-614)Online publication date: 14-Apr-2015
https://dl.acm.org/doi/10.1145/2714576.2714587
Zhu YMa DHu CAhn GHu H(2014)Secure and efficient random functions with variable-length outputJournal of Network and Computer Applications10.1016/j.jnca.2014.07.03345:C(121-133)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1016/j.jnca.2014.07.033
Xu JHu LHuang ZPeng L(2014)Modular Inversion Hidden Number Problem RevisitedProceedings of the 10th International Conference on Information Security Practice and Experience - Volume 843410.1007/978-3-319-06320-1_39(537-551)Online publication date: 5-May-2014
https://dl.acm.org/doi/10.1007/978-3-319-06320-1_39
Duc AJetchev D(2012)Hardness of Computing Individual Bits for One-Way Functions on Elliptic CurvesProceedings of the 32nd Annual Cryptology Conference on Advances in Cryptology --- CRYPTO 2012 - Volume 741710.1007/978-3-642-32009-5_48(832-849)Online publication date: 19-Aug-2012
https://dl.acm.org/doi/10.1007/978-3-642-32009-5_48
Glaβer CSelman ATravers SZhang L(2009)Non-mitotic setsTheoretical Computer Science10.1016/j.tcs.2008.12.043410:21-23(2011-2023)Online publication date: 1-May-2009
https://dl.acm.org/doi/10.1016/j.tcs.2008.12.043
Glaßer CSelman ATravers SWagner K(2008)The complexity of unions of disjoint setsJournal of Computer and System Sciences10.1016/j.jcss.2008.05.00174:7(1173-1187)Online publication date: 1-Nov-2008
https://dl.acm.org/doi/10.1016/j.jcss.2008.05.001
Vercauteren F(2008)The Hidden Root ProblemProceedings of the 2nd international conference on Pairing-Based Cryptography10.1007/978-3-540-85538-5_6(89-99)Online publication date: 1-Sep-2008
https://dl.acm.org/doi/10.1007/978-3-540-85538-5_6
Glaßer CSelman ATravers SZhang L(2007)Non-mitotic setsProceedings of the 27th international conference on Foundations of software technology and theoretical computer science10.5555/1781794.1781808(146-157)Online publication date: 12-Dec-2007
https://dl.acm.org/doi/10.5555/1781794.1781808
Jao DJetchev DVenkatesan R(2007)On the bits of elliptic curve Diffie-Hellman KeysProceedings of the cryptology 8th international conference on Progress in cryptology10.5555/1777898.1777904(33-47)Online publication date: 9-Dec-2007
https://dl.acm.org/doi/10.5555/1777898.1777904
Glaßer CSelman ATravers SWagner K(2007)The complexity of unions of disjoint setsProceedings of the 24th annual conference on Theoretical aspects of computer science10.5555/1763424.1763455(248-259)Online publication date: 22-Feb-2007
https://dl.acm.org/doi/10.5555/1763424.1763455
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Trapdoors for Ideal Lattices with Applications

Extreme fuzzy ideals and its applications on De Morgan residuated lattices

Identity-based signcryption from lattices