Paper 2008/167
Non-black-box Techniques Are Not Necessary for Constant Round Non-malleable Protocols
Omkant Pandey
Abstract
Recently, non-black-box techniques have enjoyed great success in cryptography. In particular, they have led to the construction of \emph{constant round} protocols for two basic cryptographic tasks (in the plain model): non-malleable zero-knowledge (NMZK) arguments
for NP, and non-malleable commitments. Earlier protocols, whose security proofs relied only on black-box techniques, required non-constant (e.g.,
Note: This paper has been merged with "New Age Cryptography" by Rafael Pass and Vinod Vaikuntanathan. The merged paper appears in CRYPTO 2008, under the title "Adaptive One-way Functions and Applications". Full version coming soon.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Not Yet Published
- Keywords
- Non-black-box techniquesNon-malleabilityZero KnowledgeCommitmentsGap Discrete Logarithm Assumption
- Contact author(s)
- omkant @ cs ucla edu
- History
- 2008-10-02: last of 2 revisions
- 2008-04-14: received
- See all versions
- Short URL
- https://ia.cr/2008/167
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2008/167, author = {Omkant Pandey}, title = {Non-black-box Techniques Are Not Necessary for Constant Round Non-malleable Protocols}, howpublished = {Cryptology {ePrint} Archive, Paper 2008/167}, year = {2008}, url = {https://eprint.iacr.org/2008/167} }