Nonmalleable Cryptography
From MaRDI portal
Publication:4507357
DOI10.1137/S0097539795291562zbMath0963.68067OpenAlexW2911777915WikidataQ56113985 ScholiaQ56113985MaRDI QIDQ4507357
Moni Naor, Danny Dolev, Cynthia Dwork
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539795291562
cryptographycryptanalysisrandomized algorithmsauthenticationencryptionzero-knowledgechosen ciphertext securitycommitment schemesnonmalleabilityauction protocolsnonmalleable cryptographysemantically secure cryptography
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items
Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round, NIZK from SNARGs, KDM security for the Fujisaki-Okamoto transformations in the QROM, Explicit non-malleable codes from bipartite graphs, Efficient non-malleable commitment schemes, Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes, Concurrently Composable Security with Shielded Super-Polynomial Simulators, Efficient non-malleable commitment schemes, Semi-honest to Malicious Oblivious Transfer—The Black-Box Way, Faster and Shorter Password-Authenticated Key Exchange, Non-malleable vector commitments via local equivocability, Generic constructions of integrated PKE and PEKS, Constant-Round Nonmalleable Commitments from Any One-Way Function, Non-malleable functions and their applications, Concurrent knowledge extraction in public-key models, New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications, Public key cryptography based on ergodic matrices over finite field, The security of lazy users in out-of-band authentication, Tightly secure signatures and public-key encryption, Compact Lossy and All-but-One Trapdoor Functions from Lattice, Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions, Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions, Constant-size structure-preserving signatures: generic constructions and simple assumptions, Multi-use and unidirectional identity-based proxy re-encryption schemes, On black-box extension of a non-interactive zero-knowledge proof system for secret equality, On the gold standard for security of universal steganography, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment, A semantically secure public key cryptoscheme using bit-pair shadows, A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security, Full and partial deniability for authentication schemes, Traceable PRFs: Full Collusion Resistance and Active Security, Improved, black-box, non-malleable encryption from semantic security, A new framework for deniable secure key exchange, Augmented Learning with Errors: The Untapped Potential of the Error Term, Privacy and verifiability in voting systems: methods, developments and trends, Statistical concurrent non-malleable zero-knowledge from one-way functions, NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion, Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs, Unnamed Item, On constant-round concurrent non-malleable proof systems, Universally composable symbolic security analysis, Practical chosen ciphertext secure encryption from factoring, Secure integration of asymmetric and symmetric encryption schemes, Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles, Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model, How to Encrypt with the LPN Problem, Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness, Concurrent non-malleable statistically hiding commitment, Tightly CCA-secure encryption scheme in a multi-user setting with corruptions, Continuously non-malleable secret sharing: joint tampering, plain model and capacity, Towards tight adaptive security of non-interactive key exchange, Non-malleable vector commitments via local equivocability, Non-malleable encryption: simpler, shorter, stronger, Concurrent zero knowledge, revisited, New technique for chosen-ciphertext security based on non-interactive zero-knowledge, Round-efficient black-box construction of composable multi-party computation, Lattice-based completely non-malleable public-key encryption in the standard model, Anonymous Proxy Signatures, Secure computation without authentication, Cryptography and cryptographic protocols, Non-Malleable Codes from Additive Combinatorics, A black-box construction of non-malleable encryption from semantically secure encryption, Robust encryption, Cryptography Using Captcha Puzzles, Novel \(\Omega\)-protocols for NP, Tag-KEM/DEM: A new framework for hybrid encryption, Efficient hybrid encryption from ID-based encryption, Bounds on the efficiency of black-box commitment schemes, Perfect Non-interactive Zero Knowledge for NP, Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?, The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance, Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes, A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor, OAEP Is Secure under Key-Dependent Messages, The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure, Improved efficiency of Kiltz07-KEM, Online-Untransferable Signatures, Non-malleability Under Selective Opening Attacks: Implication and Separation, Non-Malleable Encryption: Simpler, Shorter, Stronger, Non-interactive and non-malleable commitment scheme based on \(q\)-one way group homomorphisms, Clever Arbiters Versus Malicious Adversaries, Expedient Non-malleability Notions for Hash Functions, A note on universal composable zero-knowledge in the common reference string model, Comparison-Based Key Exchange and the Security of the Numeric Comparison Mode in Bluetooth v2.1, A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model, Local Sequentiality Does Not Help for Concurrent Composition, Efficient public key encryption with smallest ciphertext expansion from factoring, Practical Chosen Ciphertext Secure Encryption from Factoring, A New Randomness Extraction Paradigm for Hybrid Encryption, Compact designated verifier NIZKs from the CDH assumption without pairings, Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures, Efficient Completely Non-Malleable and RKA Secure Public Key Encryptions, Bandwidth-efficient threshold EC-DSA, Authenticated encryption: relations among notions and analysis of the generic composition paradigm, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security, Hybrid commitments and their applications to zero-knowledge proof systems, Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model, On the CCA compatibility of public-key infrastructure, Nonmalleable encryption of quantum information, Cryptography with constant input locality, New approaches for deniable authentication, A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems, Robust Encryption, Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge, Insight of the protection for data security under selective opening attacks, A public key cryptosystem based on a subgroup membership problem, Chosen ciphertext security from injective trapdoor functions, Black-box use of one-way functions is useless for optimal fair coin-tossing, A performance evaluation of pairing-based broadcast encryption systems, Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security, Anonymous protocols: notions and equivalence
