Non-malleability amplification

DOI10.1145/1536414.1536442MaRDI QIDQ5172712zbMATH OpenOpenAlexFDO

Authors Huijia Lin, Rafael Pass

Publication date 4 February 2015

Published in Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1536414.1536442

zbMATH Keywords

commitmentcryptographynon-malleabilityround complexity

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 7650428
• Amplification of Nonlinear Strain Waves in Solids
• scientific article; zbMATH DE number 4089046
• scientific article; zbMATH DE number 3299384
• scientific article; zbMATH DE number 3862574
• Taming nonrenormalizability
• scientific article; zbMATH DE number 467275
• Incompatibility induced nonlocal crystal plasticity
• Nonlinear mechanics of materials
• scientific article; zbMATH DE number 3860529

Cited in

(28)

• One-message zero knowledge and non-malleable commitments
• The security of lazy users in out-of-band authentication
• Unbounded ABE via bilinear entropy expansion, revisited
• Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
• Post-quantum multi-party computation
• Black-box non-interactive non-malleable commitments
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
• Non-malleable codes for bounded parallel-time tampering
• Non-malleable commitments against quantum attacks
• Statistical concurrent non-malleable zero-knowledge from one-way functions
• Non-interactive non-malleability from quantum supremacy
• Non-malleable vector commitments via local equivocability
• Non-malleable time-lock puzzles and applications
• scientific article; zbMATH DE number 1722670 (Why is no real title available?)
• Adaptive hardness and composable security in the plain model from standard assumptions
• Efficient string-commitment from weak bit-commitment
• Expedient Non-malleability Notions for Hash Functions
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• Non-malleable extractors: new tools and improved constructions
• Constant-Round Nonmalleable Commitments from Any One-Way Function
• Concurrently composable security with shielded super-polynomial simulators
• On the exact round complexity of self-composable two-party computation
• Non-malleable vector commitments via local equivocability
• On non-uniform security for black-box non-interactive CCA commitments
• A new approach to efficient non-malleable zero-knowledge
• Improved black-box constructions of composable secure computation
• Round-efficient composable two-party quantum computation

This page was built for publication: Non-malleability amplification

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