The Experts below are selected from a list of 1290 Experts worldwide ranked by ideXlab platform
Maurizio Catino - One of the best experts on this subject based on the ideXlab platform.
-
Mafia rules. The role of criminal codes in mafia organizations
Scandinavian Journal of Management, 2015Co-Authors: Maurizio CatinoAbstract:Abstract How can organizations that lack mechanisms of legal dispute resolution and cannot create binding contracts work efficiently? They establish and enforce organizational rules. Rules are an essential aspect in the life of any organization, and they are even more important for criminal organizations because they serve to regulate interaction among dishonest people. Using a wide range of sources, this article analyzes the role of rules in mafias, in particular in the Sicilian “Cosa Nostra” and the American “La Cosa Nostra”. The main contribution of this paper is to unveil the organizational rationality of mafia rules. Through a comprehensive analysis of the few written, and several unwritten rules, I find that rules in mafias serve three main goals: (1) to ensure organization, coordination, and cooperation among members; (2) to settle conflicts and contain violence; and (3) to Maintain Secrecy and conceal information.
M. Penurkar - One of the best experts on this subject based on the ideXlab platform.
-
A Novel Scheme to Maintain Secrecy in Ad hoc Network
Wireless Communication, 2011Co-Authors: Pragati Patil, B.n. Jagdale, M. PenurkarAbstract:Wireless sensor network composed of thousands of nodes. Since the nodes communicate with each other, they cooperate by forwarding data packets to other nodes in the network using routing protocols. However, due to security vulnerabilities of the routing protocols, the data sent by nodes are unprotected, hence need of security arises. In this paper, we evaluate the performance of multiple routing protocols (AODV, DSDV & DSR) using Random Way Point mobility model .The attempt has been made to enhance the security by encrypting data packets with the variation in packet size. The simulation is carried out using Network Simulator-2 (NS 2)
Moses Liskov - One of the best experts on this subject based on the ideXlab platform.
-
Updatable zero-knowledge databases
Lecture Notes in Computer Science, 2005Co-Authors: Moses LiskovAbstract:Micali, Rabin, and Kilian [9] recently introduced zero-knowledge sets and databases, in which a prover sets up a database by publishing a commitment, and then gives proofs about particular values. While an elegant and useful primitive, zero-knowledge databases do not offer any good way to perform updates. We explore the issue of updating zero-knowledge databases. We define and discuss transparent updates, which (1) allow holders of proofs that are still valid to update their proofs, but (2) otherwise Maintain Secrecy about the update. We give rigorous definitions for transparently updatable zero-knowledge databases, and give a practical construction based on the Chase et al [2] construction, assuming that verifiable random functions exist and that mercurial commitments exist, in the random oracle model. We also investigate the idea of updatable commitments, an attempt to make simple commitments transparently updatable. We define this new primitive and give a simple secure construction.
-
ASIACRYPT - Updatable zero-knowledge databases
Lecture Notes in Computer Science, 2005Co-Authors: Moses LiskovAbstract:Micali, Rabin, and Kilian [9] recently introduced zero- knowledge sets and databases, in which a prover sets up a database by publishing a commitment, and then gives proofs about particular values. While an elegant and useful primitive, zero-knowledge databases do not offer any good way to perform updates. We explore the issue of updating zero-knowledge databases. We define and discuss transparent updates, which (1) allow holders of proofs that are still valid to update their proofs, but (2) otherwise Maintain Secrecy about the update. We give rigorous definitions for transparently updatable zero- knowledge databases, and give a practical construction based on the Chase et al [2] construction, assuming that verifiable random functions exist and that mercurial commitments exist, in the random oracle model. We also investigate the idea of updatable commitments, an attempt to make simple commitments transparently updatable. We define this new primitive and give a simple secure construction.
Pragati Patil - One of the best experts on this subject based on the ideXlab platform.
-
A Novel Scheme to Maintain Secrecy in Ad hoc Network
Wireless Communication, 2011Co-Authors: Pragati Patil, B.n. Jagdale, M. PenurkarAbstract:Wireless sensor network composed of thousands of nodes. Since the nodes communicate with each other, they cooperate by forwarding data packets to other nodes in the network using routing protocols. However, due to security vulnerabilities of the routing protocols, the data sent by nodes are unprotected, hence need of security arises. In this paper, we evaluate the performance of multiple routing protocols (AODV, DSDV & DSR) using Random Way Point mobility model .The attempt has been made to enhance the security by encrypting data packets with the variation in packet size. The simulation is carried out using Network Simulator-2 (NS 2)
B.n. Jagdale - One of the best experts on this subject based on the ideXlab platform.
-
A Novel Scheme to Maintain Secrecy in Ad hoc Network
Wireless Communication, 2011Co-Authors: Pragati Patil, B.n. Jagdale, M. PenurkarAbstract:Wireless sensor network composed of thousands of nodes. Since the nodes communicate with each other, they cooperate by forwarding data packets to other nodes in the network using routing protocols. However, due to security vulnerabilities of the routing protocols, the data sent by nodes are unprotected, hence need of security arises. In this paper, we evaluate the performance of multiple routing protocols (AODV, DSDV & DSR) using Random Way Point mobility model .The attempt has been made to enhance the security by encrypting data packets with the variation in packet size. The simulation is carried out using Network Simulator-2 (NS 2)
