Multiparty Generation of an RSA Modulus

Chen, Megan; Cohen, Ran; Doerner, Jack; Kondi, Yashvanth; Lee, Eysa; Rosefield, Schuyler; Shelat, Abhi

doi:10.1007/978-3-030-56877-1_3

Cited by 19 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is assumed that Setup is run honestly at the very beginning of the system. This is a reasonable assumption since there are several works that propose methods to perform the generation of parameters in these algorithms employing distributed computation in multi-party setting (Bowe, Gabizon & Miers, 2017;Chen, Cohen, Doerner, Kondi, Lee, Rosefield & Shelat, 2020). An issuer key includes secret and public parameters of SPS-EQ together with trapdoors for the commitment to be signed.…”

Section: Constructionmentioning

confidence: 99%

“…Subsequently, it returns the public parameters. Since we assume that Setup is run honestly at the very beginning of the system, we would like to point out that these parameters can be computed by performing distributed computation in multi-party setting (Bowe et al, 2017;Chen et al, 2020). For notational simplicity, in the rest of the paper, we generate only a single time-lock puzzle in Setup algorithm.…”

Section: Constructionmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: Constructionmentioning

confidence: 99%

Section: Constructionmentioning

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

show abstract

“…In practice, such trusted party can be substituted by an execution of a multi-party computation (MPC) protocol where a set of mutually distrustful jointly generate the RSA modulus. Efficient protocols for this task exist [34,41], but their adoption is cumbersome and error prone. Furthermore, one needs to assume that at least one of the parties involved in this MPC protocol is behaving honestly.…”

Section: Introductionmentioning

confidence: 99%

Efficient CCA Timed Commitments in Class Groups

Thyagarajan

Castagnos

Laguillaumie

et al. 2021

Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security

View full text Add to dashboard Cite

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

show abstract