The following pages link to (Q178475):
Displaying 50 items.
- On best-possible obfuscation (Q744349) (← links)
- On the power of interaction (Q751809) (← links)
- Probabilistic encryption (Q1057832) (← links)
- Randomness in interactive proofs (Q1321030) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- The edited truth (Q1690197) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Formalizing data deletion in the context of the right to be forgotten (Q2119018) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- Leakage-resilient coin tossing (Q2251154) (← links)
- Secure multi-party computation without agreement (Q2501711) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- How to Incentivize Data-Driven Collaboration Among Competing Parties (Q2800567) (← links)
- Time-Lock Puzzles from Randomized Encodings (Q2800583) (← links)
- Efficient probabilistic checkable proofs and applications to approximation (Q2817678) (← links)
- How to Run Turing Machines on Encrypted Data (Q2849418) (← links)
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator (Q2874531) (← links)
- Erratum for (Q2875206) (← links)
- Bounded-Collusion IBE from Key Homomorphism (Q2891506) (← links)
- On basing one-way functions on NP-hardness (Q2931429) (← links)
- Distributed public key schemes secure against continual leakage (Q2933792) (← links)
- On the Cryptographic Applications of Random Functions (Extended Abstract) (Q2974488) (← links)
- A “Paradoxical” Solution to The Signature Problem (Q2974497) (← links)
- On the possibilities and limitations of pseudodeterministic algorithms (Q2986864) (← links)
- The Hidden Graph Model (Q2989026) (← links)
- The Computational Benefit of Correlated Instances (Q2989033) (← links)
- Black-Box Circular-Secure Encryption beyond Affine Functions (Q3000540) (← links)
- Collision-Free Hashing from Lattice Problems (Q3088173) (← links)
- Leakage-Resilient Coin Tossing (Q3095326) (← links)
- Program Obfuscation with Leaky Hardware (Q3102218) (← links)
- (Q3149676) (← links)
- Property testing and its connection to learning and approximation (Q3158518) (← links)
- Primality testing using elliptic curves (Q3158545) (← links)
- Delegating Computation (Q3177732) (← links)
- Resettable zero-knowledge (extended abstract) (Q3191990) (← links)
- (Q3210141) (← links)
- (Q3210163) (← links)
- (Q3212276) (← links)
- Public-Key Encryption Schemes with Auxiliary Inputs (Q3408205) (← links)
- Adaptively Secure Coin-Flipping, Revisited (Q3449514) (← links)
- How to Compute in the Presence of Leakage (Q3449567) (← links)
- How to Protect Yourself without Perfect Shredding (Q3519529) (← links)
- (Q3549643) (← links)
- (Q3549691) (← links)
- (Q3549694) (← links)
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability (Q3582745) (← links)
- Securing Computation against Continuous Leakage (Q3582748) (← links)
- On Best-Possible Obfuscation (Q3596381) (← links)
- One-Time Programs (Q3600212) (← links)
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks (Q3611783) (← links)
