A provably secure secret handshake with dynamic controlled matching

Sorniotti, Alessandro; Molva, Refik

doi:10.1016/j.cose.2009.11.004

Cited by 14 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is worth noting that Dunbar graphs, with their basis in trust, have been used to develop online 'secret handshake' security algorithms for use in pervasive technology (e.g. Safebook [167,168]). Pervasive technology aims to replace cellphone masts by using the phones themselves as waystations for transmitting a call between sender and addressee.…”

Section: Some Social Consequencesmentioning

confidence: 99%

Structure and function in human and primate social networks: implications for diffusion, network stability and health

Dunbar

2020

Proc. R. Soc. A.

View full text Add to dashboard Cite

The human social world is orders of magnitude smaller than our highly urbanized world might lead us to suppose. In addition, human social networks have a very distinct fractal structure similar to that observed in other primates. In part, this reflects a cognitive constraint, and in part a time constraint, on the capacity for interaction. Structured networks of this kind have a significant effect on the rates of transmission of both disease and information. Because the cognitive mechanism underpinning network structure is based on trust, internal and external threats that undermine trust or constrain interaction inevitably result in the fragmentation and restructuring of networks. In contexts where network sizes are smaller, this is likely to have significant impacts on psychological and physical health risks.

show abstract

Section: Some Social Consequencesmentioning

confidence: 99%

Structure and function in human and primate social networks: implications for diffusion, network stability and health

Dunbar

2020

Proc. R. Soc. A.

View full text Add to dashboard Cite

show abstract

“…Ateniese et al [3] first established the dynamic and fuzzy matching model, in which members could designate the matching policy that the opposite party should satisfy. Inspired by this dynamic matching model, many variants of secret handshakes have been constructed, such as dynamic controlled matching [29], federated secret handshakes [30] and dynamic expressive matching [31]. However, the groups in [3] differentiated only by group name are in fact managed by the same upper GA, which distributes the same group public/private keys to those groups.…”

Section: Related Workmentioning

confidence: 99%

Intersection-policy private mutual authentication from authorized private set intersection

Yan

Zhang

Wang

et al. 2020

Sci. China Inf. Sci.

View full text Add to dashboard Cite

“…If not, the decryption fails without revealing the reason of failure. As a version of non-interactive secret handshake protocol [3,4], it can be also deployed in practical applications of privacypreserving social matchmaking, Internet of things (IoT) [5,6] and data sharing services [7,8].…”

mentioning

confidence: 99%

Revocable identity‐based matchmaking encryption in the standard model

Jiang

Wang

Zhang

et al. 2023

IET Information Security

View full text Add to dashboard Cite

Identity-based Matchmaking Encryption (IB-ME) is an extension notion of matchmaking encryption (CRYPTO 2019), where a sender and a receiver can specify an access policy for the other party. In IB-ME, data encryption is performed by not only a receiver identity but also a sender's encryption key. Nevertheless, previous IB-ME schemes have not considered the problem of efficient revocation. Hence, the authors introduce a new notion of revocable IB-ME (RIB-ME) and formalise the syntax and security model of RIB-ME. In particular, the authors give an effective and simple construction of RIB-ME in the standard model, whose security is reduced to the hardness of decisional bilinear Diffie-Hellman problem and computational Diffie-Hellman problem. In addition, the authors show two extensions of our RIB-ME scheme to consider chosen-ciphertext security and forward privacy. K E Y W O R D S cryptography, public key cryptography 1 | INTRODUCTION Matchmaking Encryption: At CRYPTO 2019, Ateniese et al. [1,2] proposed the notion of matchmaking encryption (ME), which provides privacy-preserving policy matching over both the sender and receiver. In particular, sender S and receiver R can both specify policies that the other party must satisfy in order for the message to be revealed. In particular, S described by σ encrypts a message m under a specified policy R, and produces a corresponding ciphertext CT that associates with both σ and R. By also specifying a policy S that S should satisfy, R described by ρ uses its decryption key that is related to ρ to reveal the encrypted message from his target sender S. Thus, we have � If R cannot decrypt CT, it is a "mismatch case". This implies that either S is not accepted by R's policy (i.e., SðσÞ ¼ 0) or R is not accepted by S's policy (i.e., RðρÞ ¼ 0).� If R can decrypt CT, it is a "match case". This implies that both S is accepted by R's policy (i.e., SðσÞ ¼ 1), and R is accepted by S's policy (i.e., RðρÞ ¼ 1).

show abstract

A provably secure secret handshake with dynamic controlled matching

Cited by 14 publications

References 12 publications

Structure and function in human and primate social networks: implications for diffusion, network stability and health

Structure and function in human and primate social networks: implications for diffusion, network stability and health

Intersection-policy private mutual authentication from authorized private set intersection

Revocable identity‐based matchmaking encryption in the standard model

Contact Info

Product

Resources

About