The following pages link to Magic Functions (Q3452511):
Displaying 29 items.
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions (Q831176) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- On selective-opening security of deterministic primitives (Q2061952) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- Tightness subtleties for multi-user PKE notions (Q2149787) (← links)
- Secret-sharing for NP (Q2397445) (← links)
- Efficient cryptosystems from \(2^k\)-th power residue symbols (Q2397448) (← links)
- Individual simulations (Q2691606) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- On communication-efficient asynchronous MPC with adaptive security (Q2697849) (← links)
- Fiat–Shamir for Highly Sound Protocols Is Instantiable (Q2827720) (← links)
- Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks (Q2975822) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Standard Security Does Not Imply Indistinguishability Under Selective Opening (Q3181024) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Towards Key-Dependent Message Security in the Standard Model (Q5458588) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
