The following pages link to Hemanta K. Maji (Q1631314):
Displaying 35 items.
- Secure computation using leaky correlations (asymptotically optimal constructions) (Q1631316) (← links)
- Secure computation based on leaky correlations: high resilience setting (Q1678360) (← links)
- Non-malleable codes against lookahead tampering (Q1738066) (← links)
- Secure computation with constant communication overhead using multiplication embeddings (Q1738071) (← links)
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages (Q2056737) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- Constructing locally leakage-resilient linear secret-sharing schemes (Q2129019) (← links)
- Secure non-interactive simulation: feasibility and rate (Q2170112) (← links)
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness (Q2175944) (← links)
- Explicit rate-1 non-malleable codes for local tampering (Q2181860) (← links)
- The chromatic number of squares of random graphs (Q2699860) (← links)
- Optimal Computational Split-state Non-malleable Codes (Q2799103) (← links)
- A Unified Characterization of Completeness and Triviality for Secure Function Evaluation (Q2876922) (← links)
- Black-Box Separations for Differentially Private Protocols (Q2936620) (← links)
- Limits of random oracles in secure computation (Q2988865) (← links)
- Exploring the Limits of Common Coins Using Frontier Analysis of Protocols (Q3000558) (← links)
- Attribute-Based Signatures (Q3073718) (← links)
- The Limits of Common Coins: Further Results (Q3104753) (← links)
- Secure Computation from Leaky Correlated Randomness (Q3457091) (← links)
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations (Q3457113) (← links)
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations (Q3457127) (← links)
- A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security (Q3582779) (← links)
- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation (Q3611770) (← links)
- A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations (Q5261637) (← links)
- A Full Characterization of Completeness for Two-Party Randomized Function Evaluation (Q5418721) (← links)
- Stateless Cryptographic Protocols (Q5495037) (← links)
- Secure Computation from Elastic Noisy Channels (Q5739202) (← links)
- All Complete Functionalities are Reversible (Q5739203) (← links)
- On the Power of Public-Key Encryption in Secure Computation (Q5746340) (← links)
- (Q6107268) (← links)
- Graphs with tunable chromatic numbers for parallel coloring (Q6540000) (← links)
- Tight estimate of the local leakage resilience of the additive secret-sharing scheme \& its consequences (Q6561699) (← links)
- Randomized functions with high round complexity (Q6581793) (← links)
- Constructing leakage-resilient Shamir's secret sharing: over composite order fields (Q6637528) (← links)
