The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives

DOI10.1007/978-3-642-32009-5_41zbMATH Open1296.94131OpenAlexW157767723MaRDI QIDQ2914296FDOQ2914296

Authors: Mohammad Mahmoody, Rafael Pass 

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_41

Recommendations

• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Four-round black-box non-malleable schemes from one-way permutations
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Concurrent Non-malleable Commitments from Any One-Way Function

zbMATH Keywords

black-box separationsone-way functionszero-knowledge proofsprogram checkershitting set generatorsnon-black-box constructionsnon-interactive commitments

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (21)

• Black-box separations for non-interactive classical commitments in a quantum world
• On non-uniform security for black-box non-interactive CCA commitments
• On constructing one-way permutations from indistinguishability obfuscation
• Communication lower bounds of key-agreement protocols via density increment arguments
• Toward fine-grained blackbox separations between semantic and circular-security notions
• Lower bounds on assumptions behind indistinguishability obfuscation
• On constructing one-way permutations from indistinguishability obfuscation
• Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
• Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Automata, Languages and Programming
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
• Title not available (Why is that?)
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• A framework for non-interactive instance-dependent commitment schemes (NIC)
• Classical binding for quantum commitments
• Four-round black-box non-malleable schemes from one-way permutations
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Towards non-black-box lower bounds in cryptography
• General properties of quantum bit commitments (extended abstract)

This page was built for publication: The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914296)