5,597 results on '"Rangan, C. Pandu"'
Search Results
2. Efficient Lattice HIBE in the Standard Model with Shorter Public Parameters
3. Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality
4. Toward Optimal Player Weights in Secure Distributed Protocols
5. Threshold Discernible Ring Signatures
6. Compact Stateful Encryption Schemes with Ciphertext Verifiability
7. ID Based Signcryption Scheme in Standard Model
8. Identity Based Online/Offline Encryption and Signcryption Schemes Revisited
9. Attribute Based Signatures for Bounded Multi-level Threshold Circuits
10. Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience
11. The Round Complexity of Verifiable Secret Sharing: The Statistical Case
12. Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience
13. Sanitizable Signatures with Strong Transparency in the Standard Model
14. Breaking and Building of Threshold Signcryption Schemes
15. Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing
16. Spatiogram Based Fast Mode Decision in Spatial Scalable Video Coding
17. Communication Optimal Multi-valued Asynchronous Broadcast Protocol
18. Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
19. Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles
20. Certificateless KEM and Hybrid Signcryption Schemes Revisited
21. Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience
22. Pathwidth and Searching in Parameterized Threshold Graphs
23. Variants of Spreading Messages
24. On Communication Complexity of Secure Message Transmission in Directed Networks
25. On Composability of Reliable Unicast and Broadcast
26. Breaking and Building of Group Inside Signature
27. Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience
28. Identity Based Aggregate Signcryption Schemes
29. On Exponential Lower Bound for Protocols for Reliable Communication in Networks
30. The Guarding Problem – Complexity and Approximation
31. Information Theoretically Secure Multi Party Set Intersection Re-visited
32. Breaking and Fixing of an Identity Based Multi-Signcryption Scheme
33. The Round Complexity of Verifiable Secret Sharing Revisited
34. Cryptanalysis of Mu et al.’s and Li et al.’s Schemes and a Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme
35. Core and Conditional Core Path of Specified Length in Special Classes of Graphs
36. On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
37. Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
38. Round Efficient Unconditionally Secure Multiparty Computation Protocol
39. Unconditionally Reliable Message Transmission in Directed Hypergraphs
40. Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
41. Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
42. Rational Secret Sharing with Repeated Games
43. Alternative Protocols for Generalized Oblivious Transfer
44. On Optimal Probabilistic Asynchronous Byzantine Agreement
45. Steganographic Communication in Ordered Channels
46. Privacy Preserving DBSCAN Algorithm for Clustering
47. Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
48. Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
49. Privacy Preserving BIRCH Algorithm for Clustering over Vertically Partitioned Databases
50. Round-Optimal and Efficient Verifiable Secret Sharing
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.