IA Scholar Query: Threshold Schemes from Isogeny Assumptions.
https://scholar.archive.org/
Internet Archive Scholar query results feedeninfo@archive.orgFri, 05 Aug 2022 00:00:00 GMTfatcat-scholarhttps://scholar.archive.org/help1440Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey
https://scholar.archive.org/work/yvipn5l55nfg7c6wrry3ivu74m
Attribute-based encryption (ABE) cryptography is widely known for its potential to solve the scalability issue of recent public key infrastructure (PKI). It provides a fine-grained access control system with high flexibility and efficiency by labeling the secret key and ciphertext with distinctive attributes. Due to its fine-grained features, the ABE scheme is a protection layer in securing users' data and privacy in big data processing and analytics. However, quantum computing, new technology on the horizon that will transform the security and privacy environment, has begun to appear. Like the conventional ABE schemes, present cryptography is not excluded from the impacts of quantum technology as they are not made to be quantum-resistant. While most recent surveys generally touched on the generic features of attribute-based encryption schemes such as user revocation, scalability, flexibility, data confidentiality, and scope in pairing-based ABE schemes, this survey investigated quantum-resistant ABE schemes in securing big data. This survey reviews the challenges faced by the recent ABE cryptography in the post-quantum era and highlights its differences from the conventional pairing-based ABE schemes. Subsequently, we defined the criteria of an ideal quantum-resistant ABE scheme. Additionally, existing works on quantum-resistant ABE schemes are reviewed based on their algorithms design, security and functionalities. Lastly, we summarized quantum-resistant ABE schemes' ongoing challenges and future works.Zulianie Binti Jemihin, Soo Fun Tan, Gwo-Chin Chungwork_yvipn5l55nfg7c6wrry3ivu74mFri, 05 Aug 2022 00:00:00 GMTBasepoint-freeness thresholds and higher syzygies on abelian threefolds
https://scholar.archive.org/work/w36xvk7trbad5fssgwys3nsg6q
For a polarized abelian variety, Z. Jiang and G. Pareschi introduce an invariant and show that the polarization is basepoint free or projectively normal if the invariant is small. Their result is generalized to higher syzygies by F. Caucci, that is, the polarization satisfies property (N_p) if the invariant is small. In this paper, we study a relation between the invariant and degrees of abelian subvarieties with respect to the polarization. For abelian threefolds, we give an upper bound of the invariant using degrees of abelian subvarieties. In particular, we affirmatively answer some questions on abelian varieties asked by the author, V. Lozovanu and Caucci in the three dimensional case.Atsushi Itowork_w36xvk7trbad5fssgwys3nsg6qWed, 06 Jul 2022 00:00:00 GMTOn the u^∞-torsion submodule of prismatic cohomology
https://scholar.archive.org/work/advxb37htjgu3i2mm3gy7iedlq
We investigate the maximal finite length submodule of the Breuil-Kisin prismatic cohomology of a smooth proper formal scheme over a p-adic ring of integers. This submodule governs pathology phenomena in integral p-adic cohomology theories. Geometric applications include a control, in low degrees and mild ramifications, of (1) the discrepancy between two naturally associated Albanese varieties in characteristic p, and (2) kernel of the specialization map in p-adic \'etale cohomology. As an arithmetic application, we study the boundary case of the theory due to Fontaine-Laffaille, Fontaine-Messing, and Kato. Also included is an interesting example, generalized from a construction in Bhatt-Morrow-Scholze's work, which (1) illustrates some of our theoretical results being sharp, and (2) negates a question of Breuil.Shizhang Li, Tong Liuwork_advxb37htjgu3i2mm3gy7iedlqThu, 07 Apr 2022 00:00:00 GMTPost-Quantum Cryptography Algorithms Standardization and Performance Analysis
https://scholar.archive.org/work/kaqzzqt7gjcp5ixopqvbbxmarq
Quantum computer is no longer a hypothetical idea. It is the worlds most important technology and there is a race among countries to get supremacy in quantum technology. Its the technology that will reduce the computing time from years to hours or even minutes. The power of quantum computing will be a great support for the scientific community. However, it raises serious threats to cybersecurity. Theoretically, all the cryptography algorithms are vulnerable to attack. The practical quantum computers, when available with millions of qubits capacity, will be able to break nearly all modern public-key cryptographic systems. Before the quantum computers arrive with sufficient qubit capacity, we must be ready with quantum-safe cryptographic algorithms, tools, techniques, and deployment strategies to protect the ICT infrastructure. This paper discusses in detail the global effort for the design, development, and standardization of various quantum-safe cryptography algorithms along with the performance analysis of some of the potential quantum-safe algorithms. Most of the quantum-safe algorithms need more CPU cycles, higher runtime memory, and large key size. The objective of the paper is to analyze the feasibility of the various quantum-safe cryptography algorithms.Manish Kumarwork_kaqzzqt7gjcp5ixopqvbbxmarqWed, 06 Apr 2022 00:00:00 GMTA Survey on Code-Based Cryptography
https://scholar.archive.org/work/wg4bvyvszrbmzj2xbvtlkuobey
The improvements on quantum technology are threatening our daily cybersecurity, as a capable quantum computer can break all currently employed asymmetric cryptosystems. In preparation for the quantum era the National Institute of Standards and Technology (NIST) has initiated a standardization process for public-key encryption (PKE) schemes, key-encapsulation mechanisms (KEM) and digital signature schemes. With this chapter we aim at providing a survey on code-based cryptography, focusing on PKEs and signature schemes. We cover the main frameworks introduced in code-based cryptography and analyze their security assumptions. We provide the mathematical background in a lecture notes style, with the intention of reaching a wider audience.Violetta Weger, Niklas Gassner, Joachim Rosenthalwork_wg4bvyvszrbmzj2xbvtlkuobeyThu, 24 Feb 2022 00:00:00 GMTCyber-physical defense in the quantum Era
https://scholar.archive.org/work/fqm7sepmhjgdfmiarabunulwdi
Networked-Control Systems (NCSs), a type of cyber-physical systems, consist of tightly integrated computing, communication and control technologies. While being very flexible environments, they are vulnerable to computing and networking attacks. Recent NCSs hacking incidents had major impact. They call for more research on cyber-physical security. Fears about the use of quantum computing to break current cryptosystems make matters worse. While the quantum threat motivated the creation of new disciplines to handle the issue, such as post-quantum cryptography, other fields have overlooked the existence of quantum-enabled adversaries. This is the case of cyber-physical defense research, a distinct but complementary discipline to cyber-physical protection. Cyber-physical defense refers to the capability to detect and react in response to cyber-physical attacks. Concretely, it involves the integration of mechanisms to identify adverse events and prepare response plans, during and after incidents occur. In this paper, we assume that the eventually available quantum computer will provide an advantage to adversaries against defenders, unless they also adopt this technology. We envision the necessity for a paradigm shift, where an increase of adversarial resources because of quantum supremacy does not translate into a higher likelihood of disruptions. Consistently with current system design practices in other areas, such as the use of artificial intelligence for the reinforcement of attack detection tools, we outline a vision for next generation cyber-physical defense layers leveraging ideas from quantum computing and machine learning. Through an example, we show that defenders of NCSs can learn and improve their strategies to anticipate and recover from attacks.Michel Barbeau, Joaquin Garcia-Alfarowork_fqm7sepmhjgdfmiarabunulwdiThu, 03 Feb 2022 00:00:00 GMTImproved Straight-Line Extraction in the Random Oracle Model With Applications to Signature Aggregation
https://scholar.archive.org/work/llihi2ypszfulglslndm5vufau
The goal of this paper is to improve the efficiency and applicability of straightline extraction techniques in the random oracle model. Straightline extraction in the random oracle model refers to the existence of an extractor, which given the random oracle queries made by a prover P * (x) on some theorem x, is able to produce a witness w for x with roughly the same probability that P * produces a verifying proof. This notion applies to both zero-knowledge protocols and verifiable computation where the goal is compressing a proof. Pass (CRYPTO '03) first showed how to achieve this property for NP using a cut-and-choose technique which incurred a λ 2 -bit overhead in communication where λ is a security parameter. Fischlin (CRYPTO '05) presented a more efficient technique based on "proofs of work" that sheds this λ 2 cost, but only applies to a limited class of Sigma Protocols with a "quasi-unique response" property, which for example, does not necessarily include the standard OR composition for Sigma protocols. With Schnorr/EdDSA signature aggregation as a motivating application, we develop new techniques to improve the computation cost of straight-line extractable proofs. Our improvements to the state of the art range from 70×-200× for the best compression parameters. This is due to a uniquely suited polynomial evaluation algorithm, and the insight that a proof-of-work that relies on multicollisions and the birthday paradox is faster to solve than inverting a fixed target. Our collision based proof-of-work more generally improves the Prover's random oracle query complexity when applied in the NIZK setting as well. In addition to reducing the query complexity of Fischlin's Prover, for a special class of Sigma protocols we can for the first time closely match a new lower bound we present. Finally we extend Fischlin's technique so that it applies to a more general class of strongly-sound Sigma protocols, which includes the OR composition. We achieve this by carefully randomizing Fischlin's technique-we show that its current deterministic nature prevents its application to certain multiwitness languages.Yashvanth Kondi, Abhi Shelatwork_llihi2ypszfulglslndm5vufauSecurity of Cryptographic Primitives in Advanced Security Notions
https://scholar.archive.org/work/zupi7jt2wnhsjpd6rju5ybk3jm
The provable security paradigm is an important tool to show security of cryptographic primitives. Here, security follows from showing that an adversary cannot break a scheme with respect to some security notion. Standard security notions, however, often do not cover scenarios that might happen in practice. Examples are side-channel leakage as well as usage of keys and random coins that are somehow related. Another setting that often is not considered is security with respect to adversaries that have quantum computing power. In this thesis we study security of schemes in advanced security notions; these notions model more sophisticated attacks which can happen when using such schemes. We develop new advanced security notions, analyse existing primitives with respect to these, and construct primitives that achieve such advanced security notions. The first part of this thesis focuses on security outside the black-box model. Here, we develop a generic blueprint for a leakage-resilient authenticated encryption scheme from leakage-resilient functions. We then provide an instantiation entirely built from sponges. Furthermore, we provide security notions for related-key attacks against authenticated encryption schemes and analyse generic constructions with respect to these. Finally, we study the security of public key encryption schemes in case of reused random coins; we prove a simplification of the security notion which was already claimed yet backed up by a proof which was later identified as flawed. The second part focuses on security against the glooming threat of quantum computers. First, we provide positive results for the post-quantum security of several primitives. We develop a lifting theorem for public key encryption schemes from classical proofs in the random oracle model to post-quantum proofs in the quantum random oracle model. We further show post-quantum security of the sponge-based authenticated encryption scheme developed in the first part, a generic construction for deterministic wallets, and Yao's gar [...]Patrick Struckwork_zupi7jt2wnhsjpd6rju5ybk3jmOn Lattice-Based Signatures with Advanced Functionalities
https://scholar.archive.org/work/ydyijaxnujc7lftmfzpibtgkzm
Lattice-based cryptography is a prominent class of cryptographic systems that has been emerged as one of the main candidates replacing classical cryptography in future computing environments such as quantum computing. Quantum computers exploit quantum mechanical phenomena to solve computational problems, on which the security of currently deployed (classical) cryptographic systems is based. While these computational problems, e.g., factoring integers and computing discrete logarithms, are intractable for conventional (classical) computers, it is meanwhile known that they can be easily solved on quantum computers (Shor 1997). However, lattice problems, such as finding short non-zero vectors, seem to withstand attacks having quantum computing power. In the last two decades we have seen many cryptographic proposals based on lattices. In particular, lattice-based (ordinary) signature schemes were greatly improved with respect to efficiency and security. This can be observed from the post-quantum standardization process initiated by the National Institute of Standards and Technology (NIST). In fact, from the five signature schemes that have been submitted to this process, there are currently three finalists, where two of them are lattice-based submissions. In this thesis, we are specifically interested in lattice-based signature schemes with advanced functionalities. In addition to the basic security goals that an ordinary signature scheme ensures, i.e., authentication, non-repudiation, and integrity, these schemes provide features that are application-specific. While ordinary signature schemes based on lattices are ready to be deployed in practice, this statement cannot be made for lattice-based signature schemes with advanced functionalities. This thesis makes a significant progress towards deploying the aforementioned type of signature schemes in practice. With focus on privacy-preserving applications in future computing environments, we particularly facilitate the protection of secret keys in cryptocurrencies such [...]Nabil Alkeilani Alkadriwork_ydyijaxnujc7lftmfzpibtgkzmCheng_columbia_0054D_17131.pdf
https://scholar.archive.org/work/kshpli45hbg7zoffbfmyypiqkm
Geometry of q-bic Hypersurfaces Raymond Cheng Traditional algebraic geometric invariants lose some of their potency in positive characteristic. For instance, smooth projective hypersurfaces may be covered by lines despite being of arbitrarily high degree. The purpose of this dissertation is to define a class of hypersurfaces that exhibits such classically unexpected properties, and to offer a perspective with which to conceptualize such phenomena. Specifically, this dissertation proposes an analogy between the eponymous qbic hypersurfaces-special hypersurfaces of degree q + 1, with q any power of the ground field characteristic, a familiar example given by the corresponding Fermat hypersurface-and low degree hypersurfaces, especially quadrics and cubics. This analogy is substantiated by concrete results such as: q-bic hypersurfaces are moduli spaces of isotropic vectors for a bilinear form; the Fano schemes of linear spaces contained in a smooth q-bic hypersurface are smooth, irreducible, and carry structures similar to orthogonal Grassmannian; and the intermediate Jacobian of a q-bic threefold is purely inseparably isogenous to the Albanese variety of its smooth Fano surface of lines.:unavwork_kshpli45hbg7zoffbfmyypiqkmGeometry of q-bic Hypersurfaces
https://scholar.archive.org/work/vavlw6sgszhozkzad5mknsnhbi
Traditional algebraic geometric invariants lose some of their potency in positive characteristic. For instance, smooth projective hypersurfaces may be covered by lines despite being of arbitrarily high degree. The purpose of this dissertation is to define a class of hypersurfaces that exhibits such classically unexpected properties, and to offer a perspective with which to conceptualize such phenomena. Specifically, this dissertation proposes an analogy between the eponymous q-bic hypersurfaces – special hypersurfaces of degree q+1, with q any power of the ground field characteristic, a familiar example given by the corresponding Fermat hypersurface – and low degree hypersurfaces, especially quadrics and cubics. This analogy is substantiated by concrete results such as: q-bic hypersurfaces are moduli spaces of isotropic vectors for a bilinear form; the Fano schemes of linear spaces contained in a smooth q-bic hypersurface are smooth, irreducible, and carry structures similar to orthogonal Grassmannian; and the intermediate Jacobian of a q-bic threefold is purely inseparably isogenous to the Albanese variety of its smooth Fano surface of lines.Raymond Chengwork_vavlw6sgszhozkzad5mknsnhbiProfiling Side-Channel Attacks on Dilithium: A Small Bit-Fiddling Leak Breaks It All
https://scholar.archive.org/work/kaosnp7f5jdojlfb76epfanu5i
We present an end-to-end (equivalent) key recovery attack on the Dilithium lattice-based signature scheme, one of the top contenders in the NIST postquantum cryptography competition. The attack is based on a small side-channel leakage we identified in a bit unpacking procedure inside Dilithium signature generation. We then combine machine-learning based profiling with various algorithmic techniques, including least squares regression and integer linear programming, in order to leverage this small leakage into essentially full key recovery: we manage to recover, from a moderate number of side-channel traces, enough information to sign arbitrary messages. We confirm the practicality of our technique using concrete experiments against the ARM Cortext-M4 implementation of Dilithium, and verify that our attack is robust to real-world conditions such as noisy power measurements. This attack appears difficult to protect against reliably without strong side-channel countermeasures such as masking of the entire signing algorithm, and underscores the necessity of implementing such countermeasures despite their known high cost.Soundes Marzougui, Vincent Ulitzsch, Mehdi Tibouchi, Jean-Pierre Seifertwork_kaosnp7f5jdojlfb76epfanu5iEfficient Algorithms for Large Prime Characteristic Fields and Their Application to Bilinear Pairings and Supersingular Isogeny-Based Protocols
https://scholar.archive.org/work/p6dloeazzjhqdapfbasaclayue
We propose a novel approach that generalizes interleaved modular multiplication algorithms to the computation of sums of products over large prime fields. This operation has widespread use and is at the core of many cryptographic applications. The method reformulates the widely used lazy reduction technique, crucially avoiding the need for storage and computation of "double-precision" operations. Moreover, it can be easily adapted to the different methods that exist to compute modular multiplication, producing algorithms that are significantly more efficient and memory-friendly. We showcase the performance of the proposed approach in the computation of multiplication over an extension field F p k , and demonstrate its impact in two popular cryptographic settings: bilinear pairings and supersingular isogeny-based protocols. For the former, we obtain a 1.37× speedup in the computation of a full optimal ate pairing over the popular BLS12-381 curve on an x64 Intel processor; and for the latter, we show a speedup of up to 1.30× in the computation of the SIKE protocol on the same Intel platform. Keywords: Sum of products • prime fields • extension fields • bilinear pairings • BLS12-381 • supersingular isogeny-based cryptography • SIKE • efficient computation. 1 This generalization is similar to the description by Bos and Friedberger [20, Section 3.2], but without limiting to a special-form prime.Patrick Longawork_p6dloeazzjhqdapfbasaclayueZero Trust Architecture (ZTA): A Comprehensive Survey
https://scholar.archive.org/work/n5k2sicqebapfgl4savqtxzu54
We present a detailed survey of the Zero Trust (ZT) security paradigm which has a growing number of advocates in the critical infrastructure risk management space. The article employs a descriptive approach to present the fundamental tenets of ZT and provides a review of numerous potential options available for successful realization of this paradigm. We describe the role of authentication and access control in Zero Trust Architectures (ZTA) and present an in-depth discussion of state-of-the-art techniques for authentication and access control in different scenarios. Furthermore, we comprehensively discuss the conventional approaches to encryption, micro-segmentation, and security automation available for instantiating a ZTA. The article also details various challenges associated with contemporary authentication mechanisms, access control schemes, trust and risk computation techniques, micro-segmentation approaches, and Software-Defined Perimeter, that can impact the implementation of ZT in its true sense. Based upon our analysis, we finally pinpoint the potential future research directions for successful realization of ZT in critical infrastructures. INDEX TERMS Zero trust architecture (ZTA), access control, authentication, micro-segmentation, softwaredefined parameter (SDP).Naeem Firdous Syed, Syed W. Shah, Arash Shaghaghi, Adnan Anwar, Zubair Baig, Robin Dosswork_n5k2sicqebapfgl4savqtxzu54Preparation for Post-Quantum era: a survey about blockchain schemes from a post-quantum perspective
https://scholar.archive.org/work/k2m5icczozeatkhw2z6ryrseha
Blockchain is a type of Distributed Ledger Technology (DLT) that has been included in various types of fields due to its numerous benefits: transparency, efficiency, reduced costs, decentralization, and distributivity realized through public-key cryptography and hash functions. At the same time, the increased progress of quantum computers and quantum-based algorithms threatens the security of the classical cryptographic algorithms, in consequence, it represents a risk for the Blockchain technology itself. This paper briefly presents the most relevant algorithms and procedures that have contributed to the progress of quantum computing and the categories of post-quantum cryptosystems. We also included a description of the current quantum capabilities because their evolution directly influences the necessity of increasing post-quantum research. Further, the paper continues as a guide to understanding the fundamentals of blockchain technology, and the primitives that are currently used to ensure security. We provide an analysis of the most important cryptocurrencies according to their ranking by market capitalization (MC) in the context of quantum threats, and we end up with a review of post-quantum blockchain (PQB) schemes proposals.Andrada-Teodora Ciulei, Marian-Codrin Cretu, Emil Simionwork_k2m5icczozeatkhw2z6ryrsehaDevelopment of Cryptography since Shannon
https://scholar.archive.org/work/3njwlscu6zbide3bnw3mp4pxcy
This paper presents the development of cryptography since Shannon's seminal paper "Communication Theory of Secrecy Systems" in 1949.Funda Özdemir, Çetin Kaya Koçwork_3njwlscu6zbide3bnw3mp4pxcyHigher syzygies on general polarized abelian varieties of type (1,…,1,d)
https://scholar.archive.org/work/fb2jkifkqjdgbecno5zffumany
In this paper, we show that a general polarized abelian variety (X,L) of type (1,...,1,d) and dimension g satisfies property (N_p) if d ≥∑_i=0^g (p+2)^i. In particular, the case p=0 affirmatively solves a conjecture by L. Fuentes García on projective normality.Atsushi Itowork_fb2jkifkqjdgbecno5zffumanyTue, 23 Nov 2021 00:00:00 GMTCurse of Re-encryption: A Generic Power/EM Analysis on Post-Quantum KEMs
https://scholar.archive.org/work/ti2glagb7nglnjrqqbapmvcata
This paper presents a side-channel analysis (SCA) on key encapsulation mechanism (KEM) based on the Fujisaki–Okamoto (FO) transformation and its variants. The FO transformation has been widely used in actively securing KEMs from passively secure public key encryption (PKE), as it is employed in most of NIST post-quantum cryptography (PQC) candidates for KEM. The proposed attack exploits side-channel leakage during execution of a pseudorandom function (PRF) or pseudorandom number generator (PRG) in the re-encryption of KEM decapsulation as a plaintext-checking oracle that tells whether the PKE decryption result is equivalent to the reference plaintext. The generality and practicality of the plaintext-checking oracle allow the proposed attack to attain a full-key recovery of various KEMs when an active attack on the underlying PKE is known. This paper demonstrates that the proposed attack can be applied to most NIST PQC third-round KEM candidates, namely, Kyber, Saber, FrodoKEM, NTRU, NTRU Prime, HQC, BIKE, and SIKE (for BIKE, the proposed attack achieves a partial key recovery). The applicability to Classic McEliece is unclear because there is no known active attack on this cryptosystem. This paper also presents a side-channel distinguisher design based on deep learning (DL) for mounting the proposed attack on practical implementation without the use of a profiling device. The feasibility of the proposed attack is evaluated through experimental attacks on various PRF implementations (a SHAKE software, an AES software, an AES hardware, a bit-sliced masked AES software, and a masked AES hardware based on threshold implementation). Although it is difficult to implement the oracle using the leakage from the TI-based masked hardware, the success of the proposed attack against these implementations (even except for the masked hardware), which include masked software, confirms its practicality.Rei Ueno, Keita Xagawa, Yutaro Tanaka, Akira Ito, Junko Takahashi, Naofumi Hommawork_ti2glagb7nglnjrqqbapmvcataFri, 19 Nov 2021 00:00:00 GMTA Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs
https://scholar.archive.org/work/klksbdtelvawxau3qvv67dm7wq
Continuous group key agreements (CGKAs) are a class of protocols that can provide strong security guarantees to secure group messaging protocols such as Signal and MLS. Protection against device compromise is provided by commit messages: at a regular rate, each group member may refresh their key material by uploading a commit message, which is then downloaded and processed by all the other members. In practice, propagating commit messages dominates the bandwidth consumption of existing CGKAs. We propose Chained CmPKE, a CGKA with an asymmetric bandwidth cost: in a group of N members, a commit message costs O(N ) to upload and O(1) to download, for a total bandwidth cost of O(N ). In contrast, TreeKEM [14, 19, 52] costs Ω(log N ) in both directions, for a total cost Ω(N log N ). Our protocol relies on generic primitives, and is therefore readily post-quantum. We go one step further and propose post-quantum primitives that are tailored to Chained CmPKE, which allows us to cut the growth rate of uploaded commit messages by two or three orders of magnitude compared to naive instantiations. Finally, we realize a software implementation of Chained CmPKE. Our experiments show that even for groups with a size as large as N = 2 10 , commit messages can be computed and processed in less than 100 ms.Keitaro Hashimoto, Shuichi Katsumata, Eamonn Postlethwaite, Thomas Prest, Bas Westerbaanwork_klksbdtelvawxau3qvv67dm7wqFri, 12 Nov 2021 00:00:00 GMTEfficient CCA Timed Commitments in Class Groups
https://scholar.archive.org/work/ocizzkmrefawtbzmcbu56ddway
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.Sri Aravinda Krishnan Thyagarajan, Guilhem Castagnos, Fabian Laguillaumie, Giulio Malavoltawork_ocizzkmrefawtbzmcbu56ddwayFri, 12 Nov 2021 00:00:00 GMT