Magic Functions
From MaRDI portal
Publication:3452511
DOI10.1145/950620.950623zbMath1325.68034OpenAlexW2023740004MaRDI QIDQ3452511
Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
Publication date: 12 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/950620.950623
digital signaturezero knowledgeinteractive proof systeminteractive argumentFiat-Shamir methodologymagic functionselective decommitment
Cryptography (94A60) Distributed systems (68M14) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Authentication, digital signatures and secret sharing (94A62)
Related Items (31)
A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions ⋮ Interactive Oracle Proofs ⋮ Standard Security Does Not Imply Indistinguishability Under Selective Opening ⋮ Tightness subtleties for multi-user PKE notions ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Secret-sharing for NP ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Post-quantum insecurity from LWE ⋮ The hunting of the SNARK ⋮ Individual simulations ⋮ Post-quantum resettably-sound zero knowledge ⋮ Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness ⋮ On expected polynomial runtime in cryptography ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks ⋮ Possibility and impossibility results for selective decommitments ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Towards Key-Dependent Message Security in the Standard Model ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ On selective-opening security of deterministic primitives ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ General composition and universal composability in secure multiparty computation ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs ⋮ Delegation with updatable unambiguous proofs and PPAD-hardness ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier
This page was built for publication: Magic Functions
