The Experts below are selected from a list of 20871 Experts worldwide ranked by ideXlab platform
Anna Lysyanskaya - One of the best experts on this subject based on the ideXlab platform.
-
An E±cient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation¤
2014Co-Authors: Anna LysyanskayaAbstract:A credential system is a system in which users can obtain credentials from organizations and demonstrate possession of these credentials. Such a system is anonymous when transactions carried out by the same user cannot be linked. An anonymous credential system is of signi¯cant practical relevance because it is the best means of providing privacy for users. In this paper we propose a practical anonymous credential system that is based on the strong RSA assumption and the decisional Di±e-Hellman assumption modulo a safe Prime Product and is considerably superior to existing ones: (1) We give the ¯rst practical solution that allows a user to unlink-ably demonstrate possession of a credential as many times as necessary without involving the issuing organization. (2) To prevent misuse of anonymity, our scheme is the ¯rst to o®er op-tional anonymity revocation for particular transactions. (3) Our scheme o®ers separability: all organizations can choose their cryptographic keys independently of each other. Moreover, we suggest more e®ective means of preventing users from sharing their credentials, by introducing all-or-nothing sharing: a user who allows a friend to use one of her credentials once, gives him the ability to use all of her credentials, i.e., taking over her identity. This is implemented by a new primitive, called circular encryption, which is of independent interest, and can be realized from any semantically secure cryptosystem in the random oracle model
-
an efficient system for non transferable anonymous credentials with optional anonymity revocation
Theory and Application of Cryptographic Techniques, 2001Co-Authors: Jan Camenisch, Anna LysyanskayaAbstract:A credential system is a system in which users can obtain credentials from organizations and demonstrate possession of these credentials. Such a system is anonymous when transactions carried out by the same user cannot be linked. An anonymous credential system is of significant practical relevance because it is the best means of providing privacy for users. In this paper we propose a practical anonymous credential system that is based on the strong RSA assumption and the decisional Diffie-Hellman assumption modulo a safe Prime Product and is considerably superior to existing ones: (1) We give the first practical solution that allows a user to unlinkably demonstrate possession of a credential as many times as necessary without involving the issuing organization. (2) To prevent misuse of anonymity, our scheme is the first to offer optional anonymity revocation for particular transactions. (3) Our scheme offers separability: all organizations can choose their cryptographic keys independently of each other. Moreover, we suggest more effective means of preventing users from sharing their credentials, by introducing all-or-nothing sharing: a user who allows a friend to use one of her credentials once, gives him the ability to use all of her credentials, i.e., taking over her identity. This is implemented by a new primitive, called circular encryption, which is of independent interest, and can be realized from any semantically secure cryptosystem in the random oracle model.
Colin Starr - One of the best experts on this subject based on the ideXlab platform.
-
Prime power and Prime Product distance graphs
Discrete Applied Mathematics, 2019Co-Authors: Yumi Kaneda, Joshua D Laison, Jeffrey Schreinermcgraw, Colin StarrAbstract:Abstract A graph G is a k -Prime Product distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the Product of at most k Primes. A graph has Prime Product number ppn ( G ) = k if it is a k -Prime Product graph but not a ( k − 1 ) -Prime Product graph. Similarly, G is a Prime k th-power graph (resp., strict Prime k th-power graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the j th power of a Prime for j ≤ k (resp., j = k ). We prove that ppn ( K n ) = ⌈ log 2 ( n ) ⌉ − 1 , and for a nonempty k -chromatic graph G , ppn ( G ) = ⌈ log 2 ( k ) ⌉ − 1 or ppn ( G ) = ⌈ log 2 ( k ) ⌉ . We determine ppn ( G ) for all complete bi-, 3-, and 4-partite graphs. We prove that K n is a Prime k th-power graph if and only if n 7 , and we determine conditions on cycles and outerplanar graphs G for which G is a strict Prime k th-power graph. In Theorems 2.4, 2.6, and 3.3, we relate Prime Product and Prime power distance graphs to the Green–Tao Theorem, the Twin Prime Conjecture, and Fermat’s Last Theorem.
-
Prime power and Prime Product distance graphs
arXiv: Combinatorics, 2016Co-Authors: Joshua D Laison, Jeffrey Schreinermcgraw, Colin StarrAbstract:A graph $G$ is a $k$-Prime Product distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the Product of at most $k$ Primes. A graph has Prime Product number $ppn(G)=k$ if it is a $k$-Prime Product graph but not a $(k-1)$-Prime Product graph. Similarly, $G$ is a Prime $k$th-power graph (respectively, strict Prime $k$th-power graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the $j$th power of a Prime, for $j \leq k$ (respectively, the $k$th power of a Prime exactly). We prove that $ppn(K_n) = \lceil \log_2(n)\rceil - 1$, and for a nonempty $k$-chromatic graph $G$, $ppn(G) = \lceil \log_2(k)\rceil - 1$ or $ppn(G) = \lceil \log_2(k)\rceil$. We determine $ppn(G)$ for all complete bipartite, 3-partite, and 4-partite graphs. We prove that $K_n$ is a Prime $k$th-power graph if and only if $n < 7$, and we determine conditions on cycles and outerplanar graphs $G$ for which $G$ is a strict Prime $k$th-power graph. We find connections between Prime Product and Prime power distance graphs and the Twin Prime Conjecture, the Green-Tao Theorem, and Fermat's Last Theorem.
Artur Kawalec - One of the best experts on this subject based on the ideXlab platform.
-
on the complex magnitude of dirichlet beta function
arXiv: Number Theory, 2020Co-Authors: Artur KawalecAbstract:In this article, we derive an expression for the complex magnitude of the Dirichlet beta function $\beta(s)$ represented as a Euler Prime Product and compare with similar results for the Riemann zeta function. We also obtain formulas for $\beta(s)$ valid for an even and odd $k$th positive integer argument and present a set of generated formulas for $\beta(k)$ up to $11$th order, including Catalan's constant and compute these formulas numerically. Additionally, we derive a second expression for the complex magnitude of $\beta(s)$ valid in the critical strip from which we obtain a formula for the Euler-Mascheroni constant expressed in terms of zeros of the Dirichlet beta function on the critical line. Finally, we investigate the asymptotic behavior of the Euler Prime Product on the critical line.
-
Prime Product formulas for the riemann zeta function and related identities
arXiv: General Mathematics, 2019Co-Authors: Artur KawalecAbstract:In this article, we derive a Euler Prime Product formula for the magnitude of the Riemann zeta function $\zeta(s)$ valid for $\Re(s)>1$, as well as similar formulas for $\zeta(s)$ valid for an even and odd $k$th positive integer argument. We shall further give a set of generated formulas for $\zeta(k)$ up to $11$th order, including Apery's constant, and also construct formulas for $\zeta(3/2)$. We'll also validate these formulas numerically.
Saurabh Sharma - One of the best experts on this subject based on the ideXlab platform.
-
eppn extended Prime Product number based wormhole detection scheme for manets
International Conference on Intelligent Systems and Control, 2017Co-Authors: Saurabh Sharma, Rajeev Mohan SharmaAbstract:MANETs are an upcoming technology that is gaining momentum in recent years. Due to their unique characteristics, MANETs are suffering from wide range of security attacks. Wormhole is a common security issue encounter in MANETs routing protocol. A new routing protocol naming extended Prime Product number (EPPN) based on the hop count model is proposed in this article. Here hop count between source & destination is obtained depending upon the current active route. This hop count model is integrated into AODV protocol. In the proposed scheme firstly the route is selected on the basis of RREP and then hop count model calculates the hop count between source & destination. Finally wormhole DETECTION procedure will be started if the calculated hop count is greater than the received hop count in the route to get out the suspected nodes.
-
ppn Prime Product number based malicious node detection scheme for manets
IEEE International Advance Computing Conference, 2013Co-Authors: Sapna Gambhir, Saurabh SharmaAbstract:A mobile adhoc network is an autonomous network that consists of nodes which communicate with each other with wireless channel. Due to its dynamic nature and mobility of nodes, mobile adhoc networks are more vulnerable to security attack than conventional wired and wireless networks. One of the principal routing protocols AODV used in MANETs. The security of AODV protocol is influence by malicious node attack. In this attack, a malicious node injects a faked route reply claiming to have the shortest and freshest route to the destination. However, when the data packets arrive, the malicious node discards them. To preventing malicious node attack, this paper presents PPN (Prime Product Number) scheme for detection and removal of malicious node.
Joshua D Laison - One of the best experts on this subject based on the ideXlab platform.
-
Prime power and Prime Product distance graphs
Discrete Applied Mathematics, 2019Co-Authors: Yumi Kaneda, Joshua D Laison, Jeffrey Schreinermcgraw, Colin StarrAbstract:Abstract A graph G is a k -Prime Product distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the Product of at most k Primes. A graph has Prime Product number ppn ( G ) = k if it is a k -Prime Product graph but not a ( k − 1 ) -Prime Product graph. Similarly, G is a Prime k th-power graph (resp., strict Prime k th-power graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the j th power of a Prime for j ≤ k (resp., j = k ). We prove that ppn ( K n ) = ⌈ log 2 ( n ) ⌉ − 1 , and for a nonempty k -chromatic graph G , ppn ( G ) = ⌈ log 2 ( k ) ⌉ − 1 or ppn ( G ) = ⌈ log 2 ( k ) ⌉ . We determine ppn ( G ) for all complete bi-, 3-, and 4-partite graphs. We prove that K n is a Prime k th-power graph if and only if n 7 , and we determine conditions on cycles and outerplanar graphs G for which G is a strict Prime k th-power graph. In Theorems 2.4, 2.6, and 3.3, we relate Prime Product and Prime power distance graphs to the Green–Tao Theorem, the Twin Prime Conjecture, and Fermat’s Last Theorem.
-
Prime power and Prime Product distance graphs
arXiv: Combinatorics, 2016Co-Authors: Joshua D Laison, Jeffrey Schreinermcgraw, Colin StarrAbstract:A graph $G$ is a $k$-Prime Product distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the Product of at most $k$ Primes. A graph has Prime Product number $ppn(G)=k$ if it is a $k$-Prime Product graph but not a $(k-1)$-Prime Product graph. Similarly, $G$ is a Prime $k$th-power graph (respectively, strict Prime $k$th-power graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the $j$th power of a Prime, for $j \leq k$ (respectively, the $k$th power of a Prime exactly). We prove that $ppn(K_n) = \lceil \log_2(n)\rceil - 1$, and for a nonempty $k$-chromatic graph $G$, $ppn(G) = \lceil \log_2(k)\rceil - 1$ or $ppn(G) = \lceil \log_2(k)\rceil$. We determine $ppn(G)$ for all complete bipartite, 3-partite, and 4-partite graphs. We prove that $K_n$ is a Prime $k$th-power graph if and only if $n < 7$, and we determine conditions on cycles and outerplanar graphs $G$ for which $G$ is a strict Prime $k$th-power graph. We find connections between Prime Product and Prime power distance graphs and the Twin Prime Conjecture, the Green-Tao Theorem, and Fermat's Last Theorem.