article

Free access

How to exchange (secret) keys

Editor: Anita K. Jones Author:

Manuel BlumAuthors Info & Claims

ACM Transactions on Computer Systems (TOCS), Volume 1, Issue 2

Pages 175 - 193

https://doi.org/10.1145/357360.357368

Published: 01 May 1983 Publication History

PDF eReader

References

[1]

ADLEMAN, L., MANDERS, K., AND MILLER, G. On taking roots in finite fields. In Proc. 18th Annual IEEE Symposium on Foundations of Comp. Sci. (Providence, R.I., Oct. 31-Nov. 2, 1977), IEEE, New York, pp. 175-177.

Google Scholar

[2]

ANGLUIN, D. Lecture notes on the complexity of some problems in number theory. Tech. Rep. 243, Dept. of Computer Science, Yale University, New Haven, Conn., Aug. 1982.

Google Scholar

[3]

BACH, E. Fast algorithms under the extended Riemann hypothesis: A concrete estimate. In Proc. 14th Annual ACM Syrup. on Theory of Computing, (San Francisco, Calif., May 5-7, 1982), ACM, New York, pp. 290-295.

Crossref

Google Scholar

[4]

BERLEKAMP, E.R. Factoring polynomials over large finite fields. Math. Comput. 24, 111 (July 1970), 713-735.

Google Scholar

[5]

BLUM, M., AND RABIN, M.O. Mail certification by randomization. In preparation.

Google Scholar

[6]

DIFFIE, W., AND HELLMAN, M.E. Privacy and authentication: An introduction to cryptography. Proc. IEEE 67, 3 (March 1979), 397-427.

Google Scholar

[7]

EVEN, S., GOLDREICH, O., AND LEMPEL, A. A randomized protocol for signing contracts. Tech. Rep. 233, The Technion, Israel, Feb. 1982.

Google Scholar

[8]

KOLATA, G. Cryptographers gather to discuss research. Science, 214, 6 (Nov. 1981), 646-647.

Google Scholar

[9]

LEVEQUE, W.J. Fundamentals of Number Theory. Addison-Wesley, Reading, Mass., 1977.

Google Scholar

[10]

MILLER, G.L. Riemann's hypothesis and a test for primality. J. Comput. Syst. Sci. 13, 3 (Dec. 1976), 300-317.

Google Scholar

[11]

PETERSON, I. Whom do you trust. Science News 120, 13 (Sept. 1981), 205-206.

Google Scholar

[12]

RABIN, M.O. Digitalized signatures and public-key functions as intractable as factorization. Tech. Rep. 212, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Mass. 1979.

Crossref

Google Scholar

[13]

RABIN, M.O. How to exchange secrets by oblivious transfer. Manuscript, Harvard Center for Research in Computer Technology, Cambridge, Mass., 1981.

Google Scholar

[14]

RABIN, M. O. Transaction protection by beacons. Tech. Rep. 29-81, Harvard Center for Research in Computer Technology, Cambridge, Mass., 1981.

Google Scholar

[15]

RABIN, M.O. Probabilistic algorithm for testing primality. J. Number Theory 12, 1 (Feb. 1980), 128-138.

Google Scholar

[16]

RIVEST, R. L., SHAMIR, A., AND ADLEMAN, L.L. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 2 (Feb. 1978), 120-126.

Crossref

Google Scholar

[17]

SHANKS, D. Solved and Unsolved Problems in Number Theory. Chelsea Publishing Co., New York, N.Y., 1978.

Crossref

Google Scholar

[18]

SOLOVAY, R., AND STRASSEN, V. A fast Monte-Carlo test for primality. SIAM J. Comput. 6, (March 1977), 84-85.

Google Scholar

Cited By

View all

Chenli CTang WLee HJung T(2024)Fair$^{2}$2Trade: Digital Trading Platform Ensuring Exchange and Distribution FairnessIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2024.336219621:5(4827-4842)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1109/TDSC.2024.3362196
Chenli CTang WMukherjee SJung T(2024)SCAFT: A Scalable Crowd-Assisted Fair Trading Protocol2024 IEEE International Conference on Blockchain (Blockchain)10.1109/Blockchain62396.2024.00065(442-449)Online publication date: 19-Aug-2024
https://doi.org/10.1109/Blockchain62396.2024.00065
Aranha DBaum CGjøsteen KSilde TMeng WJensen CCremers CKirda E(2023)Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based AssumptionsProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3616683(1467-1481)Online publication date: 15-Nov-2023
https://dl.acm.org/doi/10.1145/3576915.3616683
Show More Cited By

Index Terms

How to exchange (secret) keys

Recommendations

A method for obtaining digital signatures and public-key cryptosystems

An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means are not needed to ...
Public-Key encryption from ID-Based encryption without one-time signature
OTM'06: Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part I

Design a secure public key encryption scheme and its security proof are one of the main interests in cryptography In 2004, Canetti, Halevi and Katz [8] constructed a public key encryption (PKE) from a selective identity-based encryption scheme with a ...
Chosen ciphertext security from identity-based encryption without strong condition
IWSEC'06: Proceedings of the 1st international conference on Security

Recently, Canetti et al [11] gave a generic construction (called CHK construction) of public key encryption (PKE) from a selective identity-based encryption scheme combined with a strong one-time signature scheme. Later, few schemes were proposed to ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Computer Systems

ACM Transactions on Computer Systems Volume 1, Issue 2

May 1983

96 pages

ISSN:0734-2071

EISSN:1557-7333

DOI:10.1145/357360

Editor:
Anita K. Jones

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1983

Published in TOCS Volume 1, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

160
Total Citations
View Citations
1,512
Total Downloads

Downloads (Last 12 months)158
Downloads (Last 6 weeks)31

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chenli CTang WLee HJung T(2024)Fair$^{2}$2Trade: Digital Trading Platform Ensuring Exchange and Distribution FairnessIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2024.336219621:5(4827-4842)Online publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1109/TDSC.2024.3362196
Chenli CTang WMukherjee SJung T(2024)SCAFT: A Scalable Crowd-Assisted Fair Trading Protocol2024 IEEE International Conference on Blockchain (Blockchain)10.1109/Blockchain62396.2024.00065(442-449)Online publication date: 19-Aug-2024
https://doi.org/10.1109/Blockchain62396.2024.00065
Aranha DBaum CGjøsteen KSilde TMeng WJensen CCremers CKirda E(2023)Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based AssumptionsProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3616683(1467-1481)Online publication date: 15-Nov-2023
https://dl.acm.org/doi/10.1145/3576915.3616683
Medley LLoe AQuaglia E(2023)SoK: Delay-Based Cryptography2023 IEEE 36th Computer Security Foundations Symposium (CSF)10.1109/CSF57540.2023.00028(169-183)Online publication date: Jul-2023
https://doi.org/10.1109/CSF57540.2023.00028
Jiang EQin BWang QWu QLi SShi WBi YTang W(2023)BDTS: Blockchain-Based Data Trading SystemInformation and Communications Security10.1007/978-981-99-7356-9_38(645-664)Online publication date: 18-Nov-2023
https://dl.acm.org/doi/10.1007/978-981-99-7356-9_38
Chan TWen TXie HXue Q(2023)Game-Theoretically Secure Protocols for the Ordinal Random Assignment ProblemApplied Cryptography and Network Security10.1007/978-3-031-33491-7_22(582-610)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1007/978-3-031-33491-7_22
Narayanam KRamakrishna VVinayagamurthy DNishad SHerlihy MNarula N(2022)Atomic cross-chain exchanges of shared assetsProceedings of the 4th ACM Conference on Advances in Financial Technologies10.1145/3558535.3559786(148-160)Online publication date: 19-Sep-2022
https://dl.acm.org/doi/10.1145/3558535.3559786
Beimel AHaitner IMakriyannis NOmri E(2022)Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private SamplingSIAM Journal on Computing10.1137/18M121078251:4(1126-1171)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1137/18M1210782
Haitner IMakriyannis NOmri E(2022)On the complexity of fair coin flippingTheoretical Computer Science10.1016/j.tcs.2022.02.010914(23-38)Online publication date: May-2022
https://doi.org/10.1016/j.tcs.2022.02.010
Ersoy OGenc ZErkin ZConti M(2021)Practical Exchange for Unique Digital Goods2021 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS)10.1109/DAPPS52256.2021.00011(49-58)Online publication date: Aug-2021
https://doi.org/10.1109/DAPPS52256.2021.00011
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

A method for obtaining digital signatures and public-key cryptosystems

Public-Key encryption from ID-Based encryption without one-time signature

Chosen ciphertext security from identity-based encryption without strong condition