Literatura académica sobre el tema "Constrained pseudorandom functions"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Constrained pseudorandom functions".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Constrained pseudorandom functions"
Kissel, Zachary A. "Key regression from constrained pseudorandom functions". Information Processing Letters 147 (julio de 2019): 10–13. http://dx.doi.org/10.1016/j.ipl.2019.02.012.
Texto completoDatta, Pratish. "Constrained pseudorandom functions from functional encryption". Theoretical Computer Science 809 (febrero de 2020): 137–70. http://dx.doi.org/10.1016/j.tcs.2019.12.004.
Texto completoDatta, Pratish, Ratna Dutta y Sourav Mukhopadhyay. "Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation". Algorithmica 81, n.º 9 (17 de mayo de 2019): 3245–390. http://dx.doi.org/10.1007/s00453-019-00576-7.
Texto completoKietzmann, Peter, Thomas C. Schmidt y Matthias Wählisch. "A Guideline on Pseudorandom Number Generation (PRNG) in the IoT". ACM Computing Surveys 54, n.º 6 (julio de 2021): 1–38. http://dx.doi.org/10.1145/3453159.
Texto completoTontini, Fabio Caratori, Osvaldo Faggioni, Nicolò Beverini y Cosmo Carmisciano. "Gaussian envelope for 3D geomagnetic data inversion". GEOPHYSICS 68, n.º 3 (mayo de 2003): 996–1007. http://dx.doi.org/10.1190/1.1581071.
Texto completoWatanabe, Yuhei, Hideki Yamamoto y Hirotaka Yoshida. "Lightweight Crypto Stack for TPMS Using Lesamnta-LW". Security and Communication Networks 2020 (24 de septiembre de 2020): 1–12. http://dx.doi.org/10.1155/2020/5738215.
Texto completoLawnik, Marcin, Lazaros Moysis y Christos Volos. "A Family of 1D Chaotic Maps without Equilibria". Symmetry 15, n.º 7 (27 de junio de 2023): 1311. http://dx.doi.org/10.3390/sym15071311.
Texto completoLeander, Gregor, Thorben Moos, Amir Moradi y Shahram Rasoolzadeh. "The SPEEDY Family of Block Ciphers". IACR Transactions on Cryptographic Hardware and Embedded Systems, 11 de agosto de 2021, 510–45. http://dx.doi.org/10.46586/tches.v2021.i4.510-545.
Texto completoTesis sobre el tema "Constrained pseudorandom functions"
Riahinia, Mahshid. "Constrained Pseudorandom Functions : New Constructions and Connections with Secure Computation". Electronic Thesis or Diss., Lyon, École normale supérieure, 2024. http://www.theses.fr/2024ENSL0022.
Texto completoPseudorandom functions (PRFs) were introduced in 1986 by Goldreich, Goldwasser, and Micali as efficient means of generating randomness and serve as essential tools in cryptography. These functions use a master secret key to map different inputs to pseudorandom outputs. Constrained pseudorandom functions (CPRFs), introduced in 2013, extend PRFs by additionally allowing the delegation of constrained keys that enable the evaluation of the function only on specific subsets of inputs. Notably, given a constrained key that evaluates the function on a subset of inputs, the output of a CPRF should remain pseudorandom on inputs outside of this subset. In this thesis, we establish links between CPRFs and two other cryptographic tools which were introduced in the context of secure computation: 1. We show how CPRFs can be constructed from homomorphic secret sharing (HSS) protocols. Homomorphic secret sharing protocols allow distributed computations over shares of a secret. We start by identifying two extensions of HSS protocols and show how they can be transformed into CPRFs generating constrained keys for subset of inputs that can be expressed via inner-product and NC1 predicates. Next, we observe that HSS protocols that already exist in the literature can be adapted to these new extensions. This leads to the discovery of five new CPRF constructions based on various standard hardness assumptions. 2.We show how CPRFs can be used to construct pseudorandom correlation functions (PCFs) for oblivious transfer (OT) correlations. PCFs for OT correlations enable two parties to generate OT-correlated pairs that can be used in fast secure computation protocols. Next, we instantiate our transformation by applying a slight modification to the well-known PRF construction of Naor and Reingold. We finally present a method for the non-interactive generation of evaluation keys for the latter instantiation which results in an efficient public-key PCF for OT correlations from standard assumptions
Capítulos de libros sobre el tema "Constrained pseudorandom functions"
Banerjee, Abhishek, Georg Fuchsbauer, Chris Peikert, Krzysztof Pietrzak y Sophie Stevens. "Key-Homomorphic Constrained Pseudorandom Functions". En Theory of Cryptography, 31–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-46497-7_2.
Texto completoHofheinz, Dennis, Akshay Kamath, Venkata Koppula y Brent Waters. "Adaptively Secure Constrained Pseudorandom Functions". En Financial Cryptography and Data Security, 357–76. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32101-7_22.
Texto completoBoneh, Dan y Brent Waters. "Constrained Pseudorandom Functions and Their Applications". En Advances in Cryptology - ASIACRYPT 2013, 280–300. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-42045-0_15.
Texto completoDeshpande, Apoorvaa, Venkata Koppula y Brent Waters. "Constrained Pseudorandom Functions for Unconstrained Inputs". En Advances in Cryptology – EUROCRYPT 2016, 124–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49896-5_5.
Texto completoBoneh, Dan, Sam Kim y David J. Wu. "Constrained Keys for Invertible Pseudorandom Functions". En Theory of Cryptography, 237–63. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70500-2_9.
Texto completoCouteau, Geoffroy, Pierre Meyer, Alain Passelègue y Mahshid Riahinia. "Constrained Pseudorandom Functions from Homomorphic Secret Sharing". En Advances in Cryptology – EUROCRYPT 2023, 194–224. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30620-4_7.
Texto completoDavidson, Alex, Shuichi Katsumata, Ryo Nishimaki, Shota Yamada y Takashi Yamakawa. "Adaptively Secure Constrained Pseudorandom Functions in the Standard Model". En Advances in Cryptology – CRYPTO 2020, 559–89. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-56784-2_19.
Texto completoDatta, Pratish, Ratna Dutta y Sourav Mukhopadhyay. "Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation". En Lecture Notes in Computer Science, 463–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017. http://dx.doi.org/10.1007/978-3-662-54388-7_16.
Texto completoDatta, Pratish. "Constrained (Verifiable) Pseudorandom Function from Functional Encryption". En Information Security Practice and Experience, 141–59. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99807-7_9.
Texto completoDodson, C. T. J. "Some Illustrations of Information Geometry in Biology and Physics". En Handbook of Research on Computational Science and Engineering, 287–315. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-61350-116-0.ch013.
Texto completo