Results 21 to 30 of about 3,013,541 (287)

Fast generators for the Diffie-Hellman key agreement protocol and malicious standards [PDF]

open access: yes, 2006
The Diffie-Hellman key agreement protocol is based on taking large powers of a generator of a prime-order cyclic group. Some generators allow faster exponentiation.
Tsaban, Boaz
core   +2 more sources

Anonymous Authentication and Key Agreement Scheme Combining the Group Key for Vehicular Ad Hoc Networks

open access: yesComplexity, 2021
Vehicular ad hoc network (VANET) is a multihop mobile wireless communication network that can realize many vehicle-related applications through multitop communication.
Mei Sun   +3 more
doaj   +1 more source

The Density Matrix Renormalization Group and the Nuclear Shell Model [PDF]

open access: yes, 2008
We summarize recent efforts to develop an angular-momentum-conserving variant of the Density Matrix Renormalization Group method into a practical truncation strategy for large-scale shell model calculations of atomic nuclei. Following a brief description
Pittel, S., Sandulescu, N., Thakur, B.
core   +1 more source

Asymmetric Group Key Agreement [PDF]

open access: yes, 2009
A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish a confidential channel among group members, we revisit the group key agreement definition and distinguish the conventional (symmetric ) group key agreement from asymmetric ...
Qianhong Wu   +4 more
openaire   +1 more source

Fog-Orchestrated and Server-Controlled Anonymous Group Authentication and Key Agreement

open access: yesIEEE Access, 2019
Fog architectures are currently present in many applications. Constrained devices equipped with sensors produce measurements that will be sent to a nearby gateway, called the fog. The fog verifies, aggregates and forwards them to the server.
Placide Shabisha   +3 more
doaj   +1 more source

Key agreement protocol in infinite semigroup representation level

open access: yesLietuvos Matematikos Rinkinys, 2007
Matrix decomposition problem over integer ring is presented. Solving methods are discussed and it is showed, that this problem is hard computational problem regard to computer memory resources.
Artūras Katvickis   +2 more
doaj   +1 more source

Research priorities for data collection and management within global acute and emergency care systems. [PDF]

open access: yes, 2013
Barriers to global emergency care development include a critical lack of data in several areas, including limited documentation of the acute disease burden, lack of agreement on essential components of acute care systems, and a lack of consensus on key ...
Bisanzo, Mark   +7 more
core   +2 more sources

Planning Collaborative Learning in Virtual Environments. La planificación del aprendizaje colaborativo en entornos virtuales [PDF]

open access: yes, 2014
Collaborative learning has a strong presence in technologysupported education and, as a result, practices being developed in the form of Computer Supported Collaborative Learning (CSCL) are more and more common.
González-Sanmamed, Mercedes   +2 more
core   +7 more sources

Communication-Efficient Group Key Agreement [PDF]

open access: yes, 2001
Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overhead and the number of protocol rounds is of secondary concern. The dramatic increased in computation power that we witnessed during the past years exposed network delay in WANs as the
Yongdae Kim, Adrian Perrig, Gene Tsudik
openaire   +1 more source

A Lightweight Certificateless Group Key Agreement Method without Pairing Based on Blockchain for Smart Grid

open access: yesFuture Internet, 2022
In smart grids, the access verification of a large number of intelligent gateways and terminal devices has become one of the main concerns to ensure system security.
Zhihao Wang, Ru Huo, Shuo Wang
doaj   +1 more source

Home - About - Disclaimer - Privacy