Article

Free access

Non-malleable cryptography

Authors:

Danny Dolev,

Cynthia Dwork, and

Moni NaorAuthors Info & Claims

STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing

January 1991

Pages 542 - 552

https://doi.org/10.1145/103418.103474

Published: 03 January 1991 Publication History

PDF eReader

References

[1]

W. Alexi, B. Chor, O. Goldreich and C. Schnorr, TlSA/Ttabtn Bits are 1/2 + 1/poly Secure, Siam Journal on Computing, 17(2) (1988), pp.194-209.

Digital Library

Google Scholar

[2]

M. Betlare and S. Micali, How to Szgn Gsven Any Trapdoor Function, Proc. 20th Annual Symposium on the Theory of Computing, Chicago, 1988, pp.32-42.

Digital Library

Google Scholar

[3]

Blum M., P. Fetdman and S. Micali, Non-Interactsve Zero-Knowledge Proof Systems, Proc. 20th Annual Symposium on the Theory of Computing, Chicago, 1988, pp 103-112.

Digital Library

Google Scholar

[4]

M. Blum, A. De Santis, S. Micali and, G. Persiano, Non-Interactzve Zero-Knowledge, MIT-LCS TM-430, May 1990.

Google Scholar

[5]

M. Blum and S. Goldwasser, An Efficient Probabslistic Public-key Encrypt,on that H, des All Partial Information, Proc. of Crypto 84, pp. 289-299.

Digital Library

Google Scholar

[6]

B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, Versfiable Secret Sharing sn the Presence of Faults, Proc. 26th FOCS, pp. 383-395, 1985.

Google Scholar

[7]

B. Chor and M. Rabin, Achzewng Independence in Logar#thmsc Number of Rounds, Proc. 6th PODC, pp. 260-268, 1987.

Digital Library

Google Scholar

[8]

Y. Desmet, C. Goutier and S Bengio, Specsal uses and abuses of the Fiat Shamir passport protocol Proc. Crypto 87, pp. 21-39.

Digital Library

Google Scholar

[9]

U. Feige and A. Sh#mir, Witness Hiding and Wztness Indzst,ngusshabihty, STOC 1990.

Google Scholar

[10]

U. Feige, A. Fiat and A. Shamir# Zero Knowledge Proofs of Identzty, J. of Cryptology 1 (2), pp 77-94. (Preliminary version in STOC 87).

Digital Library

Google Scholar

[11]

u. Feige, D. Lapldot and A. Shamir, Multiple Non- Interactzve Zero-Knowledge Proof# Based on a Single Random Strsng, Proceedings of 31st Symposium on Foundations of Computer Science, 1990, pp. 308-317.

Google Scholar

[12]

O. Goldreich, A Unz}orm Complexzty Encryption and Zero-knowledge, Technion CS-TR 570, June 1989.

Google Scholar

[13]

O. Goldreich and H. Krawczyk, On the Compos,t,on of Zero-knowledge Proof Systems, Technion CS-TR 568, June 1989. ICALP '90.

Digital Library

Google Scholar

[14]

O. Goldreich and L. Lcvin, A Hard Predicate for All One-way Functzons, Proc. 21st Annual Symposium on the Theory of Computing, Seattle, 1989, pp. 25- 32.

Digital Library

Google Scholar

[15]

S. Goldreich, S. Micali and A. Wigderson, Proofs that Yield Nothing But thezr Validity, and a Methodology of Cryptographic Protocol Dessgn, Proceedings of the 27th Symposium on the Foundation of Computer Science, 1986, pp. 174-187.

Digital Library

Google Scholar

[16]

S. Goldwasser and S. Micali, Probabslsstic Encryption, J. Com. Sys. Sci. 28 (1984), pp 270-299.

Crossref

Google Scholar

[17]

S. Goldwasser, S. Micali and C. l:tackoff, The Knowledge Complexity of Interactive Proof-Systems, Siam J. on Computing, 18(1)(1989), pp 186-208.

Digital Library

Google Scholar

[18]

S. Goldw#ser, S. Micali and R. Rivest, A Secure Dsgital S, gnature Scheme, Siam Journal on Computing, Vol. 17, 2 (1988), pp. 281-308.

Digital Library

Google Scholar

[19]

L. Levin, One-way Functsons and Pseudo-random Generators, Combinatorica 7 (1987), pp. 357-363.

Digital Library

Google Scholar

[20]

S. Micali and C. Rackoff and It. Sloan, Notions of Security of Public-Key Cryptosystems, SIAM J. on Computing 17(2) 1988, pp. 412-426.

Digital Library

Google Scholar

[21]

M.Naor,B,t Commitment Us,ng Pseudo-Randomness, Proc. of Crypto 89.

Digital Library

Google Scholar

[22]

M. Naor and M. Yung, Un,versal One.way Hash Functsons and thezr Cryptographsc A pplicatsons, Proc. 21st Annual Symposium on the Theory of Computing, Seattle, 1989, pp. 33-43.

Digital Library

Google Scholar

[23]

M. Naor and M. Yung, Public.key Cryptosystems provably secure against chosen ciphertext attacks Proc. 22nd Annual Symposium on the Theory of Computing, Baltimore, 1990, pp. 33-43.

Digital Library

Google Scholar

[24]

C. Rackoff and D. Simon, Manuscript, 1990.

Google Scholar

[25]

J. gompel, One-way Function are Necessary and Su}- ficsent .for Szgnatures, STOC 1990.

Digital Library

Google Scholar

[26]

A. C. Yao, Theory and Applications of Trapdoor }unctions, Proceedings of the 23th Symposium on the Foundation of Computer Science, 1982, pp. 80-91.

Google Scholar

Cited By

View all

Manulis MNguyen J(2024)Fully Homomorphic Encryption Beyond IND-CCA1 Security: Integrity Through VerifiabilityAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58723-8_3(63-93)Online publication date: 8-May-2024
https://doi.org/10.1007/978-3-031-58723-8_3
Libert B(2024)Vector Commitments with Proofs of Smallness: Short Range Proofs and MorePublic-Key Cryptography – PKC 202410.1007/978-3-031-57722-2_2(36-67)Online publication date: 14-Apr-2024
https://doi.org/10.1007/978-3-031-57722-2_2
Faonio AFiore DKohlweiss MRusso LZajac M(2023)From Polynomial IOP and Commitments to Non-malleable zkSNARKsTheory of Cryptography10.1007/978-3-031-48621-0_16(455-485)Online publication date: 27-Nov-2023
https://doi.org/10.1007/978-3-031-48621-0_16
Show More Cited By

Index Terms

Non-malleable cryptography
1. Security and privacy
  1. Cryptography
    1. Public key (asymmetric) techniques
      1. Public key encryption
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Non-Malleable Cryptography
Read More
Identity-Based signcryption from identity-based cryptography
WISA'11: Proceedings of the 12th international conference on Information Security Applications

A signcryption scheme encrypts and signs data in a single operation which is more efficient than using an encryption scheme combined with a signature scheme. Identity-based cryptography (IBC) does not require users to pre-compute key pairs and obtain ...
Read More
Non-Malleable Encryption: Simpler, Shorter, Stronger
TCC 2016-A: Proceedings, Part I, of the 13th International Conference on Theory of Cryptography - Volume 9562

In a seminal paper, Dolev et al.ï ź[15] introduced the notion of non-malleable encryption NM-CPA. This notion is very intriguing since it suffices for many applications of chosen-ciphertext secure encryption IND-CCA, and, yet, can be generically built ...
Read More

Comments

Information & Contributors

Information

Published In

STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing

January 1991

572 pages

ISBN:0897913973

DOI:10.1145/103418

Chairmen:
Cris Koutsougeras
Tulane Univ., New Orleans, LA
,
Jeff Vitter
Brown Univ., Providence, RI

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC91

Sponsor:

SIGACT

STOC91: 23rd Annual ACM Symposium on Theory of Computing

May 5 - 8, 1991

Louisiana, New Orleans, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

422
Total Citations
View Citations
2,814
Total Downloads

Downloads (Last 12 months)308
Downloads (Last 6 weeks)54

Other Metrics

View Author Metrics

Citations

Cited By

View all

Manulis MNguyen J(2024)Fully Homomorphic Encryption Beyond IND-CCA1 Security: Integrity Through VerifiabilityAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58723-8_3(63-93)Online publication date: 8-May-2024
https://doi.org/10.1007/978-3-031-58723-8_3
Libert B(2024)Vector Commitments with Proofs of Smallness: Short Range Proofs and MorePublic-Key Cryptography – PKC 202410.1007/978-3-031-57722-2_2(36-67)Online publication date: 14-Apr-2024
https://doi.org/10.1007/978-3-031-57722-2_2
Faonio AFiore DKohlweiss MRusso LZajac M(2023)From Polynomial IOP and Commitments to Non-malleable zkSNARKsTheory of Cryptography10.1007/978-3-031-48621-0_16(455-485)Online publication date: 27-Nov-2023
https://doi.org/10.1007/978-3-031-48621-0_16
Alamati NMaram VMasny D(2023)Non-Observable Quantum Random Oracle ModelPost-Quantum Cryptography10.1007/978-3-031-40003-2_16(417-444)Online publication date: 10-Aug-2023
https://doi.org/10.1007/978-3-031-40003-2_16
Couteau GJain AJin ZQuach W(2023)A Note on Non-interactive Zero-Knowledge from CDHAdvances in Cryptology – CRYPTO 202310.1007/978-3-031-38551-3_23(731-764)Online publication date: 9-Aug-2023
https://doi.org/10.1007/978-3-031-38551-3_23
Tran BVaudenay S(2023)A Gapless Post-quantum Hash Proof System in the Hamming MetricApplied Cryptography and Network Security10.1007/978-3-031-33488-7_25(664-694)Online publication date: 29-May-2023
https://doi.org/10.1007/978-3-031-33488-7_25
Liu XLiu SHan SGu D(2023)Fine-Grained Verifier NIZK and Its ApplicationsPublic-Key Cryptography – PKC 202310.1007/978-3-031-31371-4_17(482-511)Online publication date: 2-May-2023
https://doi.org/10.1007/978-3-031-31371-4_17
Ganesh CKondi YOrlandi CPancholi MTakahashi ATschudi D(2023)Witness-Succinct Universally-Composable SNARKsAdvances in Cryptology – EUROCRYPT 202310.1007/978-3-031-30617-4_11(315-346)Online publication date: 15-Apr-2023
https://doi.org/10.1007/978-3-031-30617-4_11
Garg RKhurana DLu GWaters B(2023)On Non-uniform Security for Black-Box Non-interactive CCA CommitmentsAdvances in Cryptology – EUROCRYPT 202310.1007/978-3-031-30545-0_7(173-204)Online publication date: 23-Apr-2023
https://dl.acm.org/doi/10.1007/978-3-031-30545-0_7
Ciampi MOrsini ESiniscalchi L(2023)Four-Round Black-Box Non-malleable Schemes from One-Way PermutationsTheory of Cryptography10.1007/978-3-031-22365-5_11(300-329)Online publication date: 1-Jan-2023
https://doi.org/10.1007/978-3-031-22365-5_11
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