The following pages link to Prabhanjan V. Ananth (Q1758158):
Displayed 45 items.
- (Q775983) (redirect page) (← links)
- Private circuits: a modular approach (Q775985) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- A new approach to round-optimal secure multiparty computation (Q1675737) (← links)
- Indistinguishability obfuscation for Turing machines: constant overhead and amortization (Q1680213) (← links)
- On secure two-party computation in three rounds (Q1690210) (← links)
- Complexity of Gröbner basis detection and border basis detection (Q1758159) (← links)
- Round-optimal secure multiparty computation with honest majority (Q1784101) (← links)
- Multi-key fully-homomorphic encryption in the plain model (Q2055713) (← links)
- Secure software leasing (Q2056750) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- Secure quantum extraction protocols (Q2119072) (← links)
- On the concurrent composition of quantum zero-knowledge (Q2120082) (← links)
- Optimal bounded-collusion secure functional encryption (Q2175911) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Fully homomorphic NIZK and NIWI proofs (Q2175946) (← links)
- Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more (Q2181876) (← links)
- Two round information-theoretic MPC with malicious security (Q2292884) (← links)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification (Q2304923) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- Unclonable encryption, revisited (Q2695639) (← links)
- Functional Encryption for Turing Machines (Q2796122) (← links)
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (Q2829226) (← links)
- Non Observability in the Random Oracle Model (Q2856158) (← links)
- Interactive Proofs under Continual Memory Leakage (Q2874536) (← links)
- New Hardness Results in Rainbow Connectivity (Q2911628) (← links)
- An Algebraic Characterization of Rainbow Connectivity (Q2914983) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- From Selective to Adaptive Security in Functional Encryption (Q3457089) (← links)
- Indistinguishability Obfuscation from Compact Functional Encryption (Q3457116) (← links)
- On the (In)security of Fischlin’s Paradigm (Q4910279) (← links)
- Border basis detection is NP-complete (Q5254148) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing (Q5402969) (← links)
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (Q5738874) (← links)
- Cryptography with Updates (Q5738983) (← links)
- Lower Bounds in the Hardware Token Model (Q5746358) (← links)
- Cryptography from pseudorandom quantum states (Q6097262) (← links)
- On the feasibility of unclonable encryption, and more (Q6104335) (← links)
- Pseudorandom (function-Like) quantum state generators: new definitions and applications (Q6114233) (← links)
- (Q6126225) (← links)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← links)
- Cloning games: a general framework for unclonable primitives (Q6190131) (← links)