Conecte-se

Bibliografias temáticas / Fiat-Shamir transform with aborts

Índice

Artigos de revistas
Teses / dissertações
Capítulos de livros

Literatura científica selecionada sobre o tema "Fiat-Shamir transform with aborts"

Autor: Grafiati

Publicado: 21 de setembro de 2024

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Fiat-Shamir transform with aborts".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Artigos de revistas sobre o assunto "Fiat-Shamir transform with aborts"

1

Cheon, Jung Hee, Hyeongmin Choe, Julien Devevey, et al. "HAETAE: Shorter Lattice-Based Fiat-Shamir Signatures." IACR Transactions on Cryptographic Hardware and Embedded Systems 2024, no. 3 (2024): 25–75. http://dx.doi.org/10.46586/tches.v2024.i3.25-75.

Texto completo da fonte

Resumo:

We present HAETAE (Hyperball bimodAl modulE rejecTion signAture schemE), a new lattice-based signature scheme. Like the NIST-selected Dilithium signature scheme, HAETAE is based on the Fiat-Shamir with Aborts paradigm, but our design choices target an improved complexity/compactness compromise that is highly relevant for many space-limited application scenarios. We primarily focus on reducing signature and verification key sizes so that signatures fit into one TCP or UDP datagram while preserving a high level of security against a variety of attacks. As a result, our scheme has signature and v

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Linh, Võ Đình. "Xây dựng lược đồ chữ ký số an toàn từ các lược đồ định danh". Journal of Science and Technology on Information security 8, № 2 (2020): 27–33. http://dx.doi.org/10.54654/isj.v8i2.30.

Texto completo da fonte

Resumo:

Tóm tắt— Trong tài liệu [3], khi trình bày về phương pháp xây dựng lược đồ chữ ký số dựa trên các lược đồ định danh chính tắc nhờ phép biến đổi Fiat-Shamir, tác giả đã chỉ ra “điều kiện đủ” để nhận được một lược đồ chữ ký số an toàn dưới tấn công sử dụng thông điệp được lựa chọn thích nghi là lược đồ định danh chính tắc phải an toàn dưới tấn công bị động. Tuy nhiên, tác giả của [3] chưa chỉ ra “điều kiện cần” đối với các lược đồ định danh chính tắc nhằm đảm bảo tính an toàn cho lược đồ chữ ký số được xây dựng. Do đó, trong bài báo này, chúng tôi hoàn thiện kết quả của [3] bằng việc chỉ ra điều

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Brier, Éric, Houda Ferradi, Marc Joye, and David Naccache. "New number-theoretic cryptographic primitives." Journal of Mathematical Cryptology 14, no. 1 (2020): 224–35. http://dx.doi.org/10.1515/jmc-2019-0035.

Texto completo da fonte

Resumo:

AbstractThis paper introduces new prq-based one-way functions and companion signature schemes. The new signature schemes are interesting because they do not belong to the two common design blueprints, which are the inversion of a trapdoor permutation and the Fiat–Shamir transform. In the basic signature scheme, the signer generates multiple RSA-like moduli ni = pi2qi and keeps their factors secret. The signature is a bounded-size prime whose Jacobi symbols with respect to the ni’s match the message digest. The generalized signature schemes replace the Jacobi symbol with higher-power residue sy

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Ye, Qing, Yongkang Lang, Zongqu Zhao, Qingqing Chen, and Yongli Tang. "Efficient Lattice-Based Ring Signature Scheme without Trapdoors for Machine Learning." Computational Intelligence and Neuroscience 2022 (September 19, 2022): 1–13. http://dx.doi.org/10.1155/2022/6547464.

Texto completo da fonte

Resumo:

Machine learning (ML) and privacy protection are inseparable. On the one hand, ML can be the target of privacy protection; on the other hand, it can also be used as an attack tool for privacy protection. Ring signature (RS) is an effective way for privacy protection in cryptography. In particular, lattice-based RS can still protect the privacy of users even in the presence of quantum computers. However, most current lattice-based RS schemes are based on a strong trapdoor like hash-and-sign, and in such constructions, there is a hidden algebraic structure, that is, added to lattice so that the

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Bellare, M., and S. Shoup. "Two-tier signatures from the Fiat–Shamir transform, with applications to strongly unforgeable and one-time signatures." IET Information Security 2, no. 2 (2008): 47. http://dx.doi.org/10.1049/iet-ifs:20070089.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Bellini, Emanuele, Chiara Marcolla, and Nadir Murru. "An Application of p-Fibonacci Error-Correcting Codes to Cryptography." Mathematics 9, no. 7 (2021): 789. http://dx.doi.org/10.3390/math9070789.

Texto completo da fonte

Resumo:

In addition to their usefulness in proving one’s identity electronically, identification protocols based on zero-knowledge proofs allow designing secure cryptographic signature schemes by means of the Fiat–Shamir transform or other similar constructs. This approach has been followed by many cryptographers during the NIST (National Institute of Standards and Technology) standardization process for quantum-resistant signature schemes. NIST candidates include solutions in different settings, such as lattices and multivariate and multiparty computation. While error-correcting codes may also be use

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Abdalla, Michel, Jee Hea An, Mihir Bellare, and Chanathip Namprempre. "From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security." IEEE Transactions on Information Theory 54, no. 8 (2008): 3631–46. http://dx.doi.org/10.1109/tit.2008.926303.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Zheng, Zhongxiang, Anyu Wang, and Lingyue Qin. "Rejection Sampling Revisit: How to Choose Parameters in Lattice-Based Signature." Mathematical Problems in Engineering 2021 (June 7, 2021): 1–12. http://dx.doi.org/10.1155/2021/9948618.

Texto completo da fonte

Resumo:

Rejection sampling technology is a core tool in the design of lattice-based signatures with ‘Fiat–Shamir with Aborts’ structure, and it is related to signing efficiency and signature, size as well as security. In the rejection sampling theorem proposed by Lyubashevsky, the masking vector of rejection sampling is chosen from discrete Gaussian distribution. However, in practical designs, the masking vector is more likely to be chosen from bounded uniform distribution due to better efficiency and simpler implementation. Besides, as one of the third-round candidate signatures in the NIST postquant

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Lee, Youngkyung, Dong Hoon Lee, and Jong Hwan Park. "Revisiting NIZK-Based Technique for Chosen-Ciphertext Security: Security Analysis and Corrected Proofs." Applied Sciences 11, no. 8 (2021): 3367. http://dx.doi.org/10.3390/app11083367.

Texto completo da fonte

Resumo:

Non-interactive zero-knowledge (NIZK) proofs for chosen-ciphertext security are generally considered to give an impractical construction. An interesting recent work by Seo, Abdalla, Lee, and Park (Information Sciences, July 2019) proposed an efficient semi-generic conversion method for achieving chosen-ciphertext security based on NIZK proofs in the random oracle model. The recent work by Seo et al. demonstrated that the semi-generic conversion method transforms a one-way (OW)-secure key encapsulation mechanism (KEM) into a chosen-ciphertext secure KEM while preserving tight security reduction

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Ulitzsch, Vincent Quentin, Soundes Marzougui, Alexis Bagia, Mehdi Tibouchi, and Jean-Pierre Seifert. "Loop Aborts Strike Back: Defeating Fault Countermeasures in Lattice Signatures with ILP." IACR Transactions on Cryptographic Hardware and Embedded Systems, August 31, 2023, 367–92. http://dx.doi.org/10.46586/tches.v2023.i4.367-392.

Texto completo da fonte

Resumo:

At SAC 2016, Espitau et al. presented a loop-abort fault attack against lattice-based signature schemes following the Fiat–Shamir with aborts paradigm. Their attack recovered the signing key by injecting faults in the sampling of the commitment vector (also called masking vector) y, leaving its coefficients at their initial zero value. As possible countermeasures, they proposed to carry out the sampling of the coefficients of y in shuffled order, or to ensure that the masking polynomials in y are not of low degree. In this paper, we show that both of these countermeasures are insufficient. We

Estilos ABNT, Harvard, Vancouver, APA, etc.

Teses / dissertações sobre o assunto "Fiat-Shamir transform with aborts"

1

Fallahpour, Pouria. "Lattice-based cryptography in a quantum setting : security proofs and attacks." Electronic Thesis or Diss., Lyon, École normale supérieure, 2024. http://www.theses.fr/2024ENSL0023.

Texto completo da fonte

Resumo:

L'émergence des machines quantiques crée des défis et des opportunités pour la cryptographie. En particulier, les preuves de sécurité doivent être révisées en raison des capacités quantiques des adversaires. Cette thèse propose deux contributions à cet égard : un résultat positif et un résultat négatif. La transformation de Fiat-Shamir avec des rejets est l’un des principaux paradigmes pour concevoir des schémas de signature post-quantiques. Une partie de cette thèse consiste en une analyse détaillée de cette transformation dans le modèle de l’oracle aléatoire quantique. Tous les travaux précé

Estilos ABNT, Harvard, Vancouver, APA, etc.

Capítulos de livros sobre o assunto "Fiat-Shamir transform with aborts"

1

Devevey, Julien, Pouria Fallahpour, Alain Passelègue, and Damien Stehlé. "A Detailed Analysis of Fiat-Shamir with Aborts." In Advances in Cryptology – CRYPTO 2023. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38554-4_11.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Bambury, Henry, Hugo Beguinet, Thomas Ricosset, and Éric Sageloli. "Polytopes in the Fiat-Shamir with Aborts Paradigm." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-68376-3_11.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Das, Dipayan. "Fiat-Shamir with Aborts: From Identification Schemes to Linkable Ring Signatures." In Security, Privacy, and Applied Cryptography Engineering. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-66626-2_9.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Lyubashevsky, Vadim. "Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures." In Advances in Cryptology – ASIACRYPT 2009. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10366-7_35.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Tan, Chik How, and Theo Fanuela Prabowo. "New Lattice-Based Signature Based on Fiat-Shamir Framework Without Aborts." In Cryptography, Codes and Cyber Security. Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-23201-5_4.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Faust, Sebastian, Markulf Kohlweiss, Giorgia Azzurra Marson, and Daniele Venturi. "On the Non-malleability of the Fiat-Shamir Transform." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34931-7_5.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Barbosa, Manuel, Gilles Barthe, Christian Doczkal, et al. "Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium." In Advances in Cryptology – CRYPTO 2023. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38554-4_12.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Lee, Ming Feng, Nigel P. Smart, and Bogdan Warinschi. "The Fiat–Shamir Transform for Group and Ring Signature Schemes." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15317-4_23.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Ciampi, Michele, and Yu Xia. "Multi-Theorem Fiat-Shamir Transform from Correlation-Intractable Hash Functions." In Applied Cryptography and Network Security. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33491-7_21.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Ciampi, Michele, Giuseppe Persiano, Luisa Siniscalchi, and Ivan Visconti. "A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles." In Theory of Cryptography. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-49099-0_4.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!