Universally Composable Accumulators

Badimtsi, Foteini; Canetti, Ran; Yakoubov, Sophia

doi:10.1007/978-3-030-40186-3_27

Cited by 8 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Stateless blockchain [21][22][23][24] Storage overhead very low; nodes are dynamically added and removed, resulting in frequent recalculations of the accumulator.…”

Section: Methodsmentioning

confidence: 99%

“…e protocol in [20] used RSA accumulators to combine large states into a short commitment to design stateless blockchains where the verifier only needs to store block headers, greatly reducing the need for disk and RAM, reducing the storage overhead of the verifier, and linearly increasing system throughput. [21] provides cryptographic accumulator universal composable (UC) processing using two weaker accumulators, constructing the accumulator in a modular fashion and extending the anonymous credential system to support revocation using the results of the UC accumulator. Libert and Yung in [22][23][24] vector commitments give commitments to ordered sequences that satisfy positional binding; i.e., an adversary algorithm should not open a commitment for two different values at the same position.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Lightweight Mutual Authentication Scheme Enabled by Stateless Blockchain for UAV Networks

Kong

Chen

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

The UAV network composed of resource-constrained lightweight UAV swarms can efficiently accomplish mission with time critical requirements in dynamic and complex environments. However, the trusted authentication of network nodes poses a huge challenge due to its own resource constraints, the lack of trusted centralized support, frequent joining or departure of UAVs to or from the network, and the presence of cyber-attacks. In this paper, we propose a stateless blockchain based on triple aggregatable subvector commitment and present a dynamic proof of trust authorization consensus mechanism with a periodic random selection of authorized nodes to guarantee the trustworthiness of mutual authentication of UAV nodes. Our proposed triple vector authentication solution solves several of the challenges mentioned above very well. The extensive experiments demonstrate that our blockchain-based authentication scheme enjoins significant advantages over the four schemes currently available for UAV network authentication in terms of single authentication latency, speed of energy consumption, average computational cost, and end-to-end latency.

show abstract

“…Stateless blockchain [21][22][23][24] Storage overhead very low; nodes are dynamically added and removed, resulting in frequent recalculations of the accumulator.…”

Section: Methodsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Lightweight Mutual Authentication Scheme Enabled by Stateless Blockchain for UAV Networks

Kong

Chen

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…We also benefit from the ideas used to hide the set of accumulated elements in our protocol from (Ghosh et al, 2016) which is also proposed in (Fuchsbauer et al, 2019) while constructing hiding set commitments. Following definitions just follow the aforementioned constructions and notation from (Badimtsi, Canetti & Yakoubov, 2020).…”

Section: Accumulatorsmentioning

confidence: 99%

Blacklisting Based Anonymous Authentication Scheme for Sharing Economy

Ozbay

Lévi

2024

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

Authentication and blacklisting mechanisms have a key role for service providers to deliver the service to correct users through digital channels. On the other hand, a user may reveal private data through the service, and an authentication/blacklisting mechanism that identifies the user may be used to link such private data to the user herself. Thus, there always have been concerns about privacy of the users. While there are previous works in the literature that provide unconditional anonymity to users, these schemes prevent service providers from blacklisting misbehaving users. At this point, the conditional anonymity concept is proposed as a remedy. A recent approach in the literature for conditional anonymity is blacklistable anonymous credentials, which allows service providers to blacklist users for an authentication session without identifying the user. In this thesis, we improve user anonymity in conditionally anonymous schemes using two complementary mechanisms. First, we define a property, whitelisting property, for blacklistable anonymous credentials and give a construction of this scheme. The whitelisting property can be used to unlink an honestly behaved authentication session from the user. Secondly, we propose an extension of this scheme for a more specific use case, sharing economy services. This scheme allows a service provider to blacklist a user only if the user have not returned the shared asset in due time. We benchmark the performance of our schemes by comparing them with the rival schemes. For communication and computation metrics, our experiments show that our first scheme has comparable performance to previous works, and our second scheme is advantageous compared to a rival one. iv ÖZET PAYLAŞIM EKONOMİSİ İÇİN KARA LİSTE TABANLI BİR ANONİM KİMLİK DOĞRULAMA ŞEMASI CAVİT ÖZBAY BİLGİSAYAR BİLİMİ VE MÜHENDİSLİĞİ YÜKSEK LİSANS TEZİ, HAZİRAN 2022 Tez Danışmanı: Prof. Dr. Albert Levi Anahtar Kelimeler: gizli kimlik, kara liste, paylaşım ekonomisi, koşullu gizlilik Kimlik doğrulama ve kara liste mekanizmaları dijitaller kanallar üzerinde çalışan servis sağlayıcılarının doğru kullanıcılara hizmet ulaştırmasında anahtar bir rol sahibidir. Öte yandan, bir kullanıcı servis süresince mahrem verilerini açığa çıkarabilir ve kullanıcıyı gerçek hayattaki kimliğini ortaya çıkaran bir kimlik doğrulama/kara liste mekanizması bu verilerin kullanıcıyla ilişkilendirilmesine sebep olabilir. Bu nedenle, bu sistemlerde kullanıcı mahremiyeti üzerine kaygılar bulunmaktadır. Literatürdeki çalışmalar kullanıcılara koşulsuz gizlilik sağlayan sistemler önerse de bu şemalar kötü niyetli kullanıcıları kara listeye alma imkanı tanımaz. Koşullu gizlilik konsepti bu noktada çözüm olarak önerilmektedir. Koşullu gizlilik için literatürdeki önerilen konseptlerden biri kara listelenebilir gizli kimliklerdir. Bu şema servis sağlayıcıların kullanıcıyı bir kimlik doğrulama oturumu için kullanıcı hakkında bilgi edinmeden kara listeye almasına imkan sağlar. Bu tezde, koşullu gizli şemalardaki kullanıcı gizliliği iki mekanizma önererek...

show abstract

“…Ghosh et al [36] put forward a strong privacy-preserving enhancement by introducing zero-knowledge accumulators. Baldimtsi et al [37] have provided the first universally composable (UC) treatment of cryptographic accumulators. Khedr et al [38] have proposed a new deterministic data integrity check scheme called cryptographic accumulator provable data possession.…”

Section: Ryptographic Accumulatormentioning

confidence: 99%

Verifiable Subgraph Matching With Cryptographic Accumulators in Cloud Computing

Zhu

Cui

et al. 2019

IEEE Access

View full text Add to dashboard Cite

Due to the rapid development of social networks, bio-informatics, internet-of-things etc., subgraph matching query can be found in various applications. Meanwhile, the increasing popularity of storing graph data in the cloud drives demands for graph query processing on a remote cloud server. However, the query results in this scenario may not be guaranteed to be correct, especially when the cloud service provider (CSP) is malicious or compromised by some adversaries, for example, a CSP might omit some edges of the graph so that its search cost would be substantially reduced. Besides, various software bugs and unintended errors are also inevitable. All current generic verifiable computation (VC) schemes applied in this scenario are not only too impractical to be implemented but also need a lot of space to locally store their auxiliary data. To that end, we have put forth both public and designated verification schemes which focus on subgraph matching problems for outsourced graph data. They utilize a modified cryptographic primitive called accumulator to realize fast verification and low local storage overhead. In addition to the two main constructions, we have proposed an optimization to make the scheme more applicable, namely, supporting dynamic updates of the graph. At last, rigorous security proofs and efficiency analysis are given, which justify that our proposed schemes are secure and efficient, satisfying the requirements of general verifiable computation protocols.INDEX TERMS Cloud computing, cryptographic accumulator, subgraph matching, verifiable computation.

show abstract

Universally Composable Accumulators

Cited by 8 publications

References 18 publications

Lightweight Mutual Authentication Scheme Enabled by Stateless Blockchain for UAV Networks

Lightweight Mutual Authentication Scheme Enabled by Stateless Blockchain for UAV Networks

Blacklisting Based Anonymous Authentication Scheme for Sharing Economy

Verifiable Subgraph Matching With Cryptographic Accumulators in Cloud Computing

Contact Info

Product

Resources

About