The following pages link to (Q4536817):
Displaying 30 items.
- Leakage-resilient cryptography from minimal assumptions (Q315546) (← links)
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Ring signatures: Stronger definitions, and constructions without random oracles (Q1027973) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- On selective-opening security of deterministic primitives (Q2061952) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- Possibility and impossibility results for receiver selective opening secure PKE in the multi-challenge setting (Q2692342) (← links)
- Non-committing encryption with constant ciphertext expansion from standard assumptions (Q2692376) (← links)
- Adaptive Security with Quasi-Optimal Rate (Q2796140) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions (Q3179365) (← links)
- Receiver Selective Opening Security from Indistinguishability Obfuscation (Q3179497) (← links)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption (Q4915998) (← links)
- Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption (Q4975186) (← links)
- Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model (Q5026392) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Removing Erasures with Explainable Hash Proof Systems (Q5738786) (← links)
- Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions (Q5919680) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Deniable cryptosystems: simpler constructions and achieving leakage resilience (Q6550608) (← links)
- Optimally-fair multi-party exchange without trusted parties (Q6550628) (← links)
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application (Q6618581) (← links)
- Compact selective opening security from LWE (Q6635895) (← links)
