Applicability of identity-based cryptography for disruption-tolerant networking

Asokan, N.; Kostiainen, Kari; Ginzboorg, Philip; Ott, Jörg; Luo, Cheng

doi:10.1145/1247694.1247705

Cited by 73 publications

(48 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In particular, we focus on a variant of reactive fragmentation where messages are fragmented at senderdefined boundaries. We use the term scrap to refer to the smallest authenticatable unit implied by fragment authentication schemes, e.g., "toilet-paper" [6] or Merkle hash tree [7]. (Those schemes are described towards the end of Section II-C.) With this approach, new partial fragments are only created from complete scraps received.…”

Section: A Fragmentation In Briefmentioning

confidence: 99%

“…Another approach is using Merkle Hash Trees (MHT) as described in [7]. Messages are proactively divided into fragments and the signed root of the corresponding MHT is attached as the authentication token of the message.…”

Section: Single-ply Toilet Paper Approach With Truncated Hashesmentioning

confidence: 99%

“…As another potential application of besteffort authentication, consider the PKI based system proposed in [7], where messages are encrypted using short-lived certificates. Problems arise when users are disconnected from the network when their short-lived certificate expires.…”

Section: Additional Implicationsmentioning

confidence: 99%

See 2 more Smart Citations

Best-effort authentication for opportunistic networks

Solis

Ginzboorg

Asokan

et al. 2011

30th IEEE International Performance Computing and Communications Conference

Self Cite

View full text Add to dashboard Cite

Abstract-Prior work has shown that uncontrolled messaging in ad-hoc opportunistic networks results in a disproportionate sharing of network capacity. Solutions based on publicly verifiable sender authentication mechanisms, such as those in [1], require complete message transmission for proper verification. However, introducing message fragmentation, e.g., to optimize limited transmission opportunities, could negatively impact resource management. Unverifiable message fragments that are assigned lower priorities are discarded sooner and reduce delivery ratios. This paper investigates the extent of this impact and shows that publicly verifiable fragment authentication mechanisms are needed to retain the benefits of fragmentation as well as resource management.We take this a step further and show through simulations that strong authenticity guarantees for intermediaries are unnecessary in our specific scenario. Best-effort authentication schemes, where the probability of false positives is much higher than in typical authentication schemes, are sufficient. This suggests the existence of other scenarios where this approach is also applicable. We describe various best-effort authentication techniques and analyze their computation and space savings.

show abstract

Section: A Fragmentation In Briefmentioning

confidence: 99%

Section: Single-ply Toilet Paper Approach With Truncated Hashesmentioning

confidence: 99%

See 1 more Smart Citation

Best-effort authentication for opportunistic networks

Solis

Ginzboorg

Asokan

et al. 2011

30th IEEE International Performance Computing and Communications Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…Nesses tipos de redes, IBC tem contribuído de forma significativa no diz respeito à confidencialidade, conforme Asokan et al (2007).…”

Section: Redes Tolerantes De Interrupção E Atraso Ou Disruption-and Dunclassified

“…Conforme Asokan et al (2007), a aplicabilidade de IBC na DTN se restringe ao aspecto da confidencialidade quando comparado com a utilização da criptografia convencional. A adoção de IBC na DTN, para assegurar a confidencialidade, é uma solução eficiente em termos de carga no servidor e requisitos de rede para outros recipientes, pois uma infra-estrutura de DTN, por ser uma mais escassa, móvel, sujeita a interferência e extremamente mais barata, comparada a uma infra-estrutura de tempo real, funciona de forma adequada com uma carga menor no servidor, bem como exige menos em termos de requisitos de um servidor.…”

Section: Redes Tolerantes De Interrupção E Atraso Ou Disruption-and Dunclassified

Um ambiente criptográfico baseado na identidade.

Misaghi¹

View full text Add to dashboard Cite

Practical distributed secret key generation for delay tolerant networks

Wang

2012

Concurrency and Computation

View full text Add to dashboard Cite

Delay tolerant networks (DTNs) are resource-constrained dynamic networks where a continuous end-to-end connectivity is not always available. In such a challenging network, a fixed infrastructure may not be connected when a DTN is partitioned or the message delay in the network is large. Thus, the traditional public key infrastructure system and identity-based encryption (IBE) system are not suitable for DTNs because they rely on centralized infrastructures and require multiple round-trip interactions. To address this issue, we propose a distributed secret key generation system with self-certified identity (SCI-DKG) that does not require any private key generator and threshold cryptosystem. Initially, each node generates a private key and distributes an initial message including a self-certified identity and secret sharings to members in a DTN. Receivers independently authenticate the identity and extracts some encryption parameters corresponding to the identity from this initial message. We prove that SCI-DKG is chosen ciphertext secure in the standard model, and it can resist potential network attacks. Simulation results show that SCI-DKG has smaller delay and higher successful ratio of secret key generation compared with IBE and hierarchical IBE systems implemented in a DTN.The specification describes three security headers for different security services, in which the confidentiality header is used to encapsulate encrypted payload of a bundle. In this paper, we focus on the secret key generation in initializing security and skip the discussion about other security issues.So far, most DTNs security studies employ an identity-based encryption (IBE) system to generate secret keys for nodes because IBE simplifies public key certificate management and has higher security performance. In an IBE system, users choose an arbitrary string (identity) as their public key, such as an email address, and the corresponding private key is issued by a private key generator (PKG) through a secure channel. We argue that the IBE system is difficult to implement in a DTN because of characteristics of large delay and frequent interruption. The centralized PKG cannot be connected when a DTN is partitioned and resources are constrained. Additionally, the security of DTNs is affected if the PKG suffers from attacks, such as blackhole attack [10,11] and denialof-service attack [12]. Therefore, the reliability of the IBE system may be questionable in DTNs. Most importantly, a PKG must verify a user's identity before a private key is issued to the user, but it is impractical if the network is in an intermittent connectivity. Consider an example in which a user wants to join a DTN by using an identity strAlice@example.com. The PKG cannot verify that the user is really the owner of this email address when the email server is disconnected.Therefore, Farrell et al. [9] suggested to adopt a distributed private key generation (DKG) system instead of an IBE system in DTNs. Unfortunately, existing DKG systems require to use a threshold cryptosyst...

show abstract

Applicability of identity-based cryptography for disruption-tolerant networking

Cited by 73 publications

References 2 publications

Best-effort authentication for opportunistic networks

Best-effort authentication for opportunistic networks

Um ambiente criptográfico baseado na identidade.

Practical distributed secret key generation for delay tolerant networks

Contact Info

Product

Resources

About