The following pages link to (Q4228521):
Displaying 50 items.
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← 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)
- Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited (Q747509) (← links)
- Optimal resilient threshold GQ signatures (Q881852) (← links)
- On expected constant-round protocols for Byzantine agreement (Q1004599) (← links)
- New approaches for deniable authentication (Q1037236) (← links)
- Composition of secure multi-party protocols. A comprehensive study. (Q1407493) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- New bounds for randomized busing (Q1770380) (← links)
- An efficient protocol for anonymous multicast and reception. (Q1853191) (← links)
- Adaptively secure distributed public-key systems. (Q1853497) (← links)
- On privacy and partition arguments (Q1854427) (← links)
- Adaptive versus non-adaptive security of multi-party protocols (Q1882568) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Tightly-secure authenticated key exchange, revisited (Q2056675) (← links)
- Compact, efficient and UC-secure isogeny-based oblivious transfer (Q2056684) (← links)
- On selective-opening security of deterministic primitives (Q2061952) (← links)
- Handling adaptive compromise for practical encryption schemes (Q2096475) (← links)
- Fully deniable interactive encryption (Q2096511) (← links)
- Reverse firewalls for actively secure MPCs (Q2096547) (← links)
- Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups (Q2106634) (← links)
- Adaptively secure computation for RAM programs (Q2170045) (← links)
- Dynamic collusion bounded functional encryption from identity-based encryption (Q2170069) (← links)
- Learning under \(p\)-tampering poisoning attacks (Q2202514) (← links)
- Leakage-resilient coin tossing (Q2251154) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- A query privacy-enhanced and secure search scheme over encrypted data in cloud computing (Q2403229) (← 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 of multi-party protocols, revisited (Q2695654) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- Concurrent composition of differential privacy (Q2697876) (← links)
- Cryptographic shallots: a formal treatment of repliable onion encryption (Q2697893) (← links)
- Standard Security Does Imply Security Against Selective Opening for Markov Distributions (Q2796129) (← links)
- Adaptive Security with Quasi-Optimal Rate (Q2796140) (← links)
- Adaptively secure computation with partial erasures (Q2796264) (← links)
- Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract) (Q2819552) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case (Q2835591) (← links)
- Adaptively secure broadcast, revisited (Q2943395) (← links)
- Selective Opening Security from Simulatable Data Encapsulation (Q2953779) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks (Q2975822) (← links)
- Secure Outsourced Computation (Q3011899) (← links)
- Leakage-Resilient Coin Tossing (Q3095326) (← links)
- Receiver Selective Opening Security from Indistinguishability Obfuscation (Q3179497) (← links)
