A new approach to efficient non-malleable zero-knowledge
From MaRDI portal
Publication:6166959
Recommendations
Cites work
- Adaptive hardness and composable security in the plain model from standard assumptions
- Adaptive One-Way Functions and Applications
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Bi-deniable public-key encryption
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Concurrent Non-malleable Commitments from Any One-Way Function
- Concurrent non-malleable zero knowledge proofs
- Concurrent non-malleable zero knowledge with adaptive inputs
- Concurrent security and non-malleability
- Concurrently composable security with shielded super-polynomial simulators
- Constant round non-malleable protocols using one way functions
- Constant-round non-malleable commitments from any one-way function
- Definitions and properties of zero-knowledge proof systems
- Efficiency preserving transformations for concurrent non-malleable zero knowledge
- Foundations of Cryptography
- Foundations of Cryptography
- Foundations of non-malleable hash and one-way functions
- Four-round concurrent non-malleable commitments from one-way functions
- How to construct constant-round zero-knowledge proof systems for NP
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1722670 (Why is no real title available?)
- scientific article; zbMATH DE number 1302864 (Why is no real title available?)
- scientific article; zbMATH DE number 1088228 (Why is no real title available?)
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- scientific article; zbMATH DE number 2009953 (Why is no real title available?)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 2009981 (Why is no real title available?)
- scientific article; zbMATH DE number 1775398 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- Magic functions
- New and improved constructions of non-malleable cryptographic protocols
- New notions of security: achieving universal composability without trusted setup
- Non-malleability amplification
- Non-malleable codes
- Non-malleable codes from additive combinatorics (extended abstract)
- Non-malleable extractors and symmetric key cryptography from weak secrets
- Non-malleable zero knowledge: black-box constructions and definitional relationships
- On Efficient Zero-Knowledge PCPs
- On the concrete efficiency of probabilistically-checkable proofs
- On the existence of three round zero-knowledge proofs
- On the Non-malleability of the Fiat-Shamir Transform
- Probabilistically checkable proofs of proximity with zero-knowledge
- Promise zero knowledge and its applications to round optimal MPC
- Random Oracles and Auxiliary Input
- Round optimal concurrent non-malleability from polynomial hardness
- Round optimal secure multiparty computation from minimal assumptions
- Round-efficient black-box construction of composable multi-party computation
- Security and composition of multiparty cryptographic protocols
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Textbook non-malleable commitments
- The Exact Round Complexity of Secure Computation
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Universal Arguments and their Applications
- Universally Composable Security with Global Setup
- Universally composable two-party and multi-party secure computation
- Zero knowledge in the random oracle model, revisited
Cited in
(11)- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Towards malicious security of private coin honest verifier zero knowledge for NP via witness encryption
- scientific article; zbMATH DE number 6720551 (Why is no real title available?)
- New and improved constructions of non-malleable cryptographic protocols
- scientific article; zbMATH DE number 1955784 (Why is no real title available?)
- Improving Efficiency of an ‘On the Fly’ Identification Scheme by Perfecting Zero-Knowledgeness
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- CDS composition of multi-round protocols
- Black-box (and fast) non-malleable zero knowledge
- Four-round statistical non-malleable zero-knowledge
- Critical rounds in multi-round proofs: proof of partial knowledge and trapdoor commitments
This page was built for publication: A new approach to efficient non-malleable zero-knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166959)
