The following pages link to (Q4228521):
Displaying 33 items.
- Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts (Q3181025) (← links)
- Deniable Attribute Based Encryption for Branching Programs from LWE (Q3181031) (← links)
- How to Compute in the Presence of Leakage (Q3449567) (← links)
- Key Insulation and Intrusion Resilience over a Public Channel (Q3623037) (← links)
- Adaptively Secure Two-Party Computation with Erasures (Q3623039) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption (Q4915998) (← links)
- Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited (Q4916020) (← links)
- On the Connection between Leakage Tolerance and Adaptive Security (Q4916027) (← links)
- How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
- Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model (Q5026392) (← links)
- Verifiable Range Query Processing for Cloud Computing (Q5056027) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation (Q5261691) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307267) (← links)
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer (Q5387104) (← links)
- Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions (Q5738752) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Removing Erasures with Explainable Hash Proof Systems (Q5738786) (← links)
- One-Sided Adaptively Secure Two-Party Computation (Q5746345) (← links)
- Simple and generic constructions of succinct functional encryption (Q5918349) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- New and improved constructions for partially equivocable public key encryption (Q6134818) (← links)
- YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model (Q6135416) (← links)
- Anonymous public key encryption under corruptions (Q6135442) (← links)
- Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication (Q6157506) (← links)
- Two-round adaptively secure MPC from isogenies, LPN, or CDH (Q6157520) (← links)
- Revocable cryptography from learning with errors (Q6587947) (← links)
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions (Q6635749) (← links)
- SoK: public key encryption with openings (Q6635892) (← links)
- Chosen-ciphertext secure dual-receiver encryption in the standard model based on post-quantum assumptions (Q6635899) (← links)
- Adaptively secure 5 round threshold signatures from \textsf{MLWE}/\textsf{MSIS} and \textsf{DL} with rewinding (Q6653016) (← links)
