The following pages link to Nishanth Chandran (Q901365):
Displayed 28 items.
- Almost-everywhere secure computation with edge corruptions (Q901366) (← links)
- Function secret sharing for mixed-mode and fixed-point secure computation (Q2056774) (← links)
- Adaptive extractors and their application to leakage resilient secret sharing (Q2129011) (← links)
- Universally composable secure computation with corrupted tokens (Q2304927) (← links)
- Reducing Depth in Constrained PRFs: From Bit-Fixing to $$\mathbf {NC}^{1}$$ (Q2798807) (← links)
- Information-Theoretic Local Non-malleable Codes and Their Applications (Q2799102) (← links)
- Privacy amplification with asymptotically optimal entropy loss (Q2875205) (← links)
- Functional Re-encryption and Collusion-Resistant Obfuscation (Q2891497) (← links)
- Position-Based Cryptography (Q2929699) (← links)
- Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions (Q2945374) (← links)
- The Hidden Graph Model (Q2989026) (← links)
- Edge Fault Tolerance on Sparse Networks (Q3167034) (← links)
- Position Based Cryptography (Q3183576) (← links)
- Improved Fault Tolerance and Secure Computation on Sparse Networks (Q3587443) (← links)
- Public-Key Encryption with Efficient Amortized Updates (Q3588328) (← links)
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks (Q3627444) (← links)
- (Q4598167) (← links)
- (Q4638057) (← links)
- Improved algorithms for optimal embeddings (Q4962750) (← links)
- Position-Based Quantum Cryptography: Impossibility and Constructions (Q5199205) (← links)
- Re-encryption, Functional Re-encryption, and Multi-hop Re-encryption: A Framework for Achieving Obfuscation-Based Security and Instantiations from Lattices (Q5402966) (← links)
- Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing (Q5402969) (← links)
- Position-Based Quantum Cryptography: Impossibility and Constructions (Q5419034) (← links)
- Ring Signatures of Sub-linear Size Without Random Oracles (Q5428828) (← links)
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware (Q5458613) (← links)
- Privacy amplification with asymptotically optimal entropy loss (Q5501933) (← links)
- Locally Updatable and Locally Decodable Codes (Q5746350) (← links)
- Short leakage resilient and non-malleable secret sharing schemes (Q6097261) (← links)