Search

Your search keyword '"Rangan, C. Pandu"' showing total 11,937 results
Start Over Author "Rangan, C. Pandu"

Refine your results

more »

more »

more »

more »
11,937 results on '"Rangan, C. Pandu"'

1. Forward Security Under Leakage Resilience, Revisited

Author

Chakraborty, Suvradip, Karthikeyan, Harish, O’Neill, Adam, Rangan, C. Pandu, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Deng, Jing, editor, Kolesnikov, Vladimir, editor, and Schwarzmann, Alexander A., editor

Published
2023
Full Text
View/download PDF

2. Reoptimization of Path Vertex Cover Problem

Author

Kumar, Mehul, Kumar, Amit, and Rangan, C. Pandu

Subjects
Computer Science - Data Structures and Algorithms
Abstract

Most optimization problems are notoriously hard. Considerable efforts must be spent in obtaining an optimal solution to certain instances that we encounter in the real world scenarios. Often it turns out that input instances get modified locally in some small ways due to changes in the application world. The natural question here is, given an optimal solution for an old instance $I_O$, can we construct an optimal solution for the new instance $I_N$, where $I_N$ is the instance $I_O$ with some local modifications. Reoptimization of NP-hard optimization problem precisely addresses this concern. It turns out that for some reoptimization versions of the NP-hard problems, we may only hope to obtain an approximate solution to a new instance. In this paper, we specifically address the reoptimization of path vertex cover problem. The objective in $k$-$path$ vertex cover problem is to compute a minimum subset $S$ of the vertices in a graph $G$ such that after removal of $S$ from $G$ there is no path with $k$ vertices in the graph. We show that when a constant number of vertices are inserted, reoptimizing unweighted $k$-$path$ vertex cover problem admits a PTAS. For weighted $3$-$path$ vertex cover problem, we show that when a constant number of vertices are inserted, the reoptimization algorithm achieves an approximation factor of $1.5$, hence an improvement from known $2$-approximation algorithm for the optimization version. We provide reoptimization algorithm for weighted $k$-$path$ vertex cover problem $(k \geq 4)$ on bounded degree graphs, which is also an NP-hard problem. Given a $\rho$-approximation algorithm for $k$-$path$ vertex cover problem on bounded degree graphs, we show that it can be reoptimized within an approximation factor of $(2-\frac{1}{\rho})$ under constant number of vertex insertions.

Published
2019

6. Two-Stage Framework for Accurate and Differentially Private Network Information Publication

Author

Adhikari, Maneesh Babu, Suppakitpaisarn, Vorapong, Paul, Arinjita, Rangan, C. Pandu, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Chellappan, Sriram, editor, Choo, Kim-Kwang Raymond, editor, and Phan, NhatHai, editor

Published
2020
Full Text
View/download PDF

7. Efficient Attribute-Based Proxy Re-Encryption with Constant Size Ciphertexts

Author

Paul, Arinjita, Selvi, S. Sharmila Deva, Rangan, C. Pandu, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Bhargavan, Karthikeyan, editor, Oswald, Elisabeth, editor, and Prabhakaran, Manoj, editor

Published
2020
Full Text
View/download PDF

8. Stable Marriage Problem with Ties and Incomplete bounded length preference list under social stability

Author

Shrivastava, Ashish and Rangan, C. Pandu

Subjects
Computer Science - Data Structures and Algorithms
Abstract

We consider a variant of socially stable marriage problem where preference lists may be incomplete, may contain ties and may have bounded length. In real world application like NRMP and Scottish medical matching scheme such restrictions arise very frequently where set of agents (man/woman) is very large and providing a complete and strict order preference list is practically in-feasible. In presence of ties in preference lists, the most common solution is weakly socially stable matching. It is a fact that in an instance, weakly stable matching can have different sizes. This motivates the problem of finding a maximum cardinality weakly socially stable matching., Comment: This paper has been withdrawn by the author due to a change in algorithm

Published
2016

9. A Closer Look at Anonymous Proxy Re-Encryption Schemes

Author

Selvi, S. Sharmila Deva, Harish, S., Dhanabal, Swethashree, Rangan, C. Pandu, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Wang, Guojun, editor, Feng, Jun, editor, Bhuiyan, Md Zakirul Alam, editor, and Lu, Rongxing, editor

Published
2019
Full Text
View/download PDF

10. Public Key Encryption Resilient to Post-challenge Leakage and Tampering Attacks

Author

Chakraborty, Suvradip, Rangan, C. Pandu, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, and Matsui, Mitsuru, editor

Published
2019
Full Text
View/download PDF

13. Identity-Based Group Encryption Revisited

Author

Gupta, Kanika, Selvi, S. Sharmila Deva, Rangan, C. Pandu, Dighe, Shubham Sopan, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Qing, Sihan, editor, Mitchell, Chris, editor, Chen, Liqun, editor, and Liu, Dongmei, editor

Published
2018
Full Text
View/download PDF

14. Rational Secret Sharing over an Asynchronous Broadcast Channel with Information Theoretic Security

Author

Moses Jr., William K. and Rangan, C. Pandu

Subjects
Computer Science - Cryptography and Security, Computer Science - Computer Science and Game Theory
Abstract

We consider the problem of rational secret sharing introduced by Halpern and Teague [1], where the players involved in secret sharing play only if it is to their advantage. This can be characterized in the form of preferences. Players would prefer to get the secret than to not get it and secondly with lesser preference, they would like as few other players to get the secret as possible. Several positive results have already been published to efficiently solve the problem of rational secret sharing but only a handful of papers have touched upon the use of an asynchronous broadcast channel. [2] used cryptographic primitives, [3] used an interactive dealer, and [4] used an honest minority of players in order to handle an asynchronous broadcast channel. In our paper, we propose an m-out-of-n rational secret sharing scheme which can function over an asynchronous broadcast channel without the use of cryptographic primitives and with a non-interactive dealer. This is possible because our scheme uses a small number, k+1, of honest players. The protocol is resilient to coalitions of size up to k and furthermore it is {\epsilon}-resilient to coalitions of size up to and including m-1. The protocol will have a strict Nash equilibrium with probability Pr((k+1)/n) and an {\epsilon}-Nash equilibrium with probability Pr((n-k-1)/n) . Furthermore, our protocol is immune to backward induction. Later on in the paper, we extend our results to include malicious players as well. We also show that our protocol handles the possibility of a player deviating in order to force another player to get a wrong value in what we believe to be a more time efficient manner than was done in Asharov and Lindell [5]., Comment: 18 pages, 2 tables

Published
2011
Full Text
View/download PDF

15. On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs

Author

Ghosh, Esha, Ghosh, Subhas K., and Rangan, C. Pandu

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

Hamiltonicity is an important property in parallel and distributed computation. Existence of Hamiltonian cycle allows efficient emulation of distributed algorithms on a network wherever such algorithm exists for linear-array and ring, and can ensure deadlock freedom in some routing algorithms in hierarchical interconnection networks. Hamiltonicity can also be used for construction of independent spanning tree and leads to designing fault tolerant protocols. Optical Transpose Interconnection Systems or OTIS (also referred to as two-level swapped network) is a widely studied interconnection network topology which is popular due to high degree of scalability, regularity, modularity and package ability. Surprisingly, to our knowledge, only one strong result is known regarding Hamiltonicity of OTIS - showing that OTIS graph built of Hamiltonian base graphs are Hamiltonian. In this work we consider Hamiltonicity of OTIS networks, built on Non-Hamiltonian base and answer some important questions. First, we prove that Hamiltonicity of base graph is not a necessary condition for the OTIS to be Hamiltonian. We present an infinite family of Hamiltonian OTIS graphs composed on Non-Hamiltonian base graphs. We further show that, it is not sufficient for the base graph to have Hamiltonian path for the OTIS constructed on it to be Hamiltonian. We give constructive proof of Hamiltonicity for a large family of Butterfly-OTIS. This proof leads to an alternate efficient algorithm for independent spanning trees construction on this class of OTIS graphs. Our algorithm is linear in the number of vertices as opposed to the generalized algorithm, which is linear in the number of edges of the graph.

Published
2011

16. Cache Me If You Can: Capacitated Selfish Replication Games in Networks

Author

Gopalakrishnan, Ragavendran, Kanoulas, Dimitrios, Karuturi, Naga Naresh, Rangan, C. Pandu, Rajaraman, Rajmohan, and Sundaram, Ravi

Subjects
Computer Science - Computer Science and Game Theory
Abstract

In Peer-to-Peer (P2P) network systems, content (object) delivery between nodes is often required. One way to study such a distributed system is by defining games, which involve selfish nodes that make strategic choices on replicating content in their local limited memory (cache) or accessing content from other nodes for a cost. These Selfish Replication games have been introduced in [8] for nodes that do not have any capacity limits, leaving the capacitated problem, i.e. Capacitated Selfish Replication (CSR) games, open. In this work, we first form the model of the CSR games, for which we perform a Nash equilibria analysis. In particular, we focus on hierarchical networks, given their extensive use to model communication costs of content delivery in P2P systems. We present an exact polynomial-time algorithm for any hierarchical network, under two constraints on the utility functions: 1) "Nearer is better", i.e. the closest the content is to the node the less its access cost is, and 2) "Independence of irrelevant alternatives", i.e. aggregation of individual node preferences. This generalization represents a vast class of utilities and more interestingly allows each of the nodes to have simultaneously completely different functional forms of utility functions. In this general framework, we present CSR games results on arbitrary networks and outline the boundary between intractability and effective computability in terms of the network structure, object preferences, and the total number of objects. Moreover, we prove that the problem of equilibria existence becomes NP-hard for general CSR games., Comment: *Dimitrios Kanoulas: corresponding author

Published
2010

17. Communication and Round Efficient Information Checking Protocol

Author

Patra, Arpita and Rangan, C. Pandu

Subjects
Computer Science - Cryptography and Security
Abstract

In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing (VSS) and Weak Secret Sharing (WSS) protocols. Informally, ICP is a tool for authenticating messages in the presence of computationally unbounded corrupted parties. Here we extend the basic bare-bone definition of ICP, introduced by Rabin et al. and then present an ICP that attains the best communication complexity and round complexity among all the existing ICPs in the literature. We also show that our ICP satisfies several interesting properties such as linearity property which is an important requirement in many applications of ICP. Though not presented in this paper, we can design communication and round efficient statistical (i.e involves negligible error probability in computation) VSS and Multiparty Computation (MPC) protocol using our new ICP.

Published
2010

22. Efficient Compilers for After-the-Fact Leakage: From CPA to CCA-2 Secure PKE to AKE

Author

Chakraborty, Suvradip, Paul, Goutam, Rangan, C. Pandu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Pieprzyk, Josef, editor, and Suriadi, Suriadi, editor

Published
2017
Full Text
View/download PDF

25. Forward-Secure Authenticated Symmetric Key Exchange Protocol: New Security Model and Secure Construction

Author

Chakraborty, Suvradip, Paul, Goutam, Rangan, C. Pandu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Au, Man-Ho, editor, and Miyaji, Atsuko, editor

Published
2015
Full Text
View/download PDF

28. A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory

Author

Mathew, K. Preetha, Vasant, Sachin, Rangan, C. Pandu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Lee, Hyang-Sook, editor, and Han, Dong-Guk, editor

Published
2014
Full Text
View/download PDF

29. Lattice Based Identity Based Unidirectional Proxy Re-Encryption Scheme

Author

Singh, Kunwar, Rangan, C. Pandu, Banerjee, A. K., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Chakraborty, Rajat Subhra, editor, Matyas, Vashek, editor, and Schaumont, Patrick, editor

Published
2014
Full Text
View/download PDF

30. Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality

Author

Srinathan, Kannan, Patra, Arpita, Choudhary, Ashish, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Srinathan, K., editor, Rangan, C. Pandu, editor, and Yung, Moti, editor

Published
2007
Full Text
View/download PDF

33. Threshold Discernible Ring Signatures

Author

Kumar, Swarun, Agrawal, Shivank, Venkatesan, Ramarathnam, Lokam, Satyanarayana V., Rangan, C. Pandu, Obaidat, Mohammad S., editor, Tsihrintzis, George A., editor, and Filipe, Joaquim, editor

Published
2012
Full Text
View/download PDF

34. Compact Stateful Encryption Schemes with Ciphertext Verifiability

Author

Vivek, S. Sree, Selvi, S. Sharmila Deva, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Hanaoka, Goichiro, editor, and Yamauchi, Toshihiro, editor

Published
2012
Full Text
View/download PDF

35. ID Based Signcryption Scheme in Standard Model

Author

Selvi, S. Sharmila Deva, Vivek, S. Sree, Vinayagamurthy, Dhinakaran, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Takagi, Tsuyoshi, editor, Wang, Guilin, editor, Qin, Zhiguang, editor, Jiang, Shaoquan, editor, and Yu, Yong, editor

Published
2012
Full Text
View/download PDF

36. Identity Based Online/Offline Encryption and Signcryption Schemes Revisited

Author

Selvi, S. Sharmila Deva, Vivek, S. Sree, Rangan, C. Pandu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Joye, Marc, editor, Mukhopadhyay, Debdeep, editor, and Tunstall, Michael, editor

Published
2011
Full Text
View/download PDF

37. Attribute Based Signatures for Bounded Multi-level Threshold Circuits

Author

Kumar, Swarun, Agrawal, Shivank, Balaraman, Subha, Rangan, C. Pandu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Camenisch, Jan, editor, and Lambrinoudakis, Costas, editor

Published
2011
Full Text
View/download PDF

38. Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience

Author

Patra, Arpita, Rangan, C. Pandu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Fehr, Serge, editor

Published
2011
Full Text
View/download PDF

40. The Round Complexity of Verifiable Secret Sharing: The Statistical Case

Author

Kumaresan, Ranjit, Patra, Arpita, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Abe, Masayuki, editor

Published
2010
Full Text
View/download PDF

41. Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience

Author

Patra, Arpita, Choudhary, Ashish, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bao, Feng, editor, Yung, Moti, editor, Lin, Dongdai, editor, and Jing, Jiwu, editor

Published
2010
Full Text
View/download PDF

42. Sanitizable Signatures with Strong Transparency in the Standard Model

Author

Agrawal, Shivank, Kumar, Swarun, Shareef, Amjed, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bao, Feng, editor, Yung, Moti, editor, Lin, Dongdai, editor, and Jing, Jiwu, editor

Published
2010
Full Text
View/download PDF

43. Breaking and Building of Threshold Signcryption Schemes

Author

Selvi, S. Sharmila Deva, Vivek, S. Sree, Nayak, Shilpi, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bao, Feng, editor, Yung, Moti, editor, Lin, Dongdai, editor, and Jing, Jiwu, editor

Published
2010
Full Text
View/download PDF

44. Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing

Author

Selvi, S. Sharmila Deva, Vivek, S. Sree, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bao, Feng, editor, Yung, Moti, editor, Lin, Dongdai, editor, and Jing, Jiwu, editor

Published
2010
Full Text
View/download PDF

45. Spatiogram Based Fast Mode Decision in Spatial Scalable Video Coding

Author

Sundar, R. Shyam, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Qiu, Guoping, editor, Lam, Kin Man, editor, Kiya, Hitoshi, editor, Xue, Xiang-Yang, editor, Kuo, C.-C. Jay, editor, and Lew, Michael S., editor

Published
2010
Full Text
View/download PDF

46. Communication Optimal Multi-valued Asynchronous Broadcast Protocol

Author

Patra, Arpita, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Abdalla, Michel, editor, and Barreto, Paulo S. L. M., editor

Published
2010
Full Text
View/download PDF

47. Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience

Author

Patra, Arpita, Choudhary, Ashish, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Kurosawa, Kaoru, editor

Published
2010
Full Text
View/download PDF

48. Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles

Author

Narasimhan, Harikrishna, Varadarajan, Venkatanathan, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Kwak, Jin, editor, Deng, Robert H., editor, Won, Yoojae, editor, and Wang, Guilin, editor

Published
2010
Full Text
View/download PDF

49. Certificateless KEM and Hybrid Signcryption Schemes Revisited

Author

Selvi, S. Sharmila Deva, Vivek, S. Sree, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Kwak, Jin, editor, Deng, Robert H., editor, Won, Yoojae, editor, and Wang, Guilin, editor

Published
2010
Full Text
View/download PDF

50. Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience

Author

Patra, Arpita, Choudhury, Ashish, Rangan, C. Pandu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Bernstein, Daniel J., editor, and Lange, Tanja, editor

Published
2010
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results