Literatura científica selecionada sobre o tema "Message adversary"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Message adversary".
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 "Message adversary"
TONIEN, DONGVU, REIHANEH SAFAVI-NAINI e PETER WILD. "ON "THE POWER OF VERIFICATION QUERIES" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION". Discrete Mathematics, Algorithms and Applications 03, n.º 03 (setembro de 2011): 287–303. http://dx.doi.org/10.1142/s1793830911001218.
Texto completo da fonteHaroutunian, Mariam, Parandzem Hakobyan e Arman Avetisyan. "Two-Stage Optimal Hypotheses Testing for a Model of Stegosystem with an Active Adversary". JUCS - Journal of Universal Computer Science 29, n.º 11 (28 de novembro de 2023): 1254–73. http://dx.doi.org/10.3897/jucs.112913.
Texto completo da fonteAkhmetzyanova, Liliya R., e Alexandra A. Babueva. "On the unforgeability of the Chaum - Pedersen blind signature scheme". Prikladnaya Diskretnaya Matematika, n.º 65 (2024): 41–65. http://dx.doi.org/10.17223/20710410/65/3.
Texto completo da fonteGuo, Li, e Gang Yao. "Protocols for Message Authentication from a Weak Secret". Applied Mechanics and Materials 380-384 (agosto de 2013): 2892–96. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.2892.
Texto completo da fonteRyabko, Boris. "Unconditionally Secure Ciphers with a Short Key for a Source with Unknown Statistics". Entropy 25, n.º 10 (30 de setembro de 2023): 1406. http://dx.doi.org/10.3390/e25101406.
Texto completo da fontePatra, Arpita, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan e Prasad Raghavendra. "Perfectly reliable and secure message transmission tolerating mobile adversary". International Journal of Applied Cryptography 1, n.º 3 (2009): 200. http://dx.doi.org/10.1504/ijact.2009.023467.
Texto completo da fonteHu, Zhi Wen, Xian Ming Wang, Tao Tao Lv, Shan Shan Zhao e Rui Jun Jing. "Random Linear Network Coding with Probabilistic Polynomial-Time Wiretap Adversary". Applied Mechanics and Materials 556-562 (maio de 2014): 6354–57. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.6354.
Texto completo da fonteZhong, Sheng. "An Efficient and Secure Cryptosystem for Encrypting Long Messages". Fundamenta Informaticae 71, n.º 4 (janeiro de 2006): 493–97. https://doi.org/10.3233/fun-2006-71407.
Texto completo da fonteBishara, Azmi. "The Quest for Strategy". Journal of Palestine Studies 32, n.º 2 (1 de janeiro de 2003): 41–49. http://dx.doi.org/10.1525/jps.2003.32.2.41.
Texto completo da fontePriya R., Sathiya, e V. Gokulakrishnan. "Effectively Secure Data Retrieving for Using Three Different Level Security". International Journal of Advance Research and Innovation 3, n.º 2 (2015): 49–53. http://dx.doi.org/10.51976/ijari.321512.
Texto completo da fonteTeses / dissertações sobre o assunto "Message adversary"
Yang, Q. "Secure message transmission in the general adversary model". Thesis, University College London (University of London), 2011. http://discovery.ucl.ac.uk/1334691/.
Texto completo da fonteAlbouy, Timothé. "Foundations of reliable cooperation under asynchrony, Byzantine faults, and message adversaries". Electronic Thesis or Diss., Université de Rennes (2023-....), 2024. http://www.theses.fr/2024URENS062.
Texto completo da fonteThis thesis explores fault-tolerant distributed systems. It focuses more specifically on implementing reliable broadcast in asynchronous environments prone to hybrid failures. We introduce a novel computing model combining Byzantine process failures with a message adversary. We then define the Message-Adversary-tolerant Byzantine Reliable Broadcast (MBRB) abstraction and prove its optimal resilience condition. We present three key algorithms implementing this abstraction: a simple signature-based MBRB algorithm, a new primitive called k2l-cast for cryptography-free MBRB implementations, and an erasure-coding-based MBRB algorithm optimizing communication complexity. These contributions advance the understanding of fault-tolerant distributed systems and provide a foundation for designing resilient and efficient distributed algorithms, with applications in critical infrastructures, financial systems, and blockchain technologies
Livros sobre o assunto "Message adversary"
Perkins, James C. Midnight Religion: Messages of Victory in the Midst of Adversity. Sims Media Group, 2016.
Encontre o texto completo da fonteOssei-Owusu, Shaun. Barack Obama’s Anomalous Relationship with the Hip-Hop Community. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252036453.003.0014.
Texto completo da fonteWellman, Trisha, Christine Merriman, Ann Aubin Gibson, Kari Aum e Christa Swart. My Mess Is My Message: Inspiring Stories of Incredible Women Who Found Purpose and Prosperity Through Adversity. Independently Published, 2022.
Encontre o texto completo da fonteYoung People, You Are under Attack!: A Message to Bring Out the Leader in Today's Youth, Despite Adversity. Independently Published, 2022.
Encontre o texto completo da fonteGibbs, Robert. Young People, You Are under Attack!: A Message to Bring Out the Leader in Today's Youth, Despite Adversity. Independently Published, 2022.
Encontre o texto completo da fonteWilson, Lindsay. Job. Wm. B. Eerdmans Publishing Co., 2015. http://dx.doi.org/10.5040/bci-008j.
Texto completo da fonteCapítulos de livros sobre o assunto "Message adversary"
Serjantov, Andrei, e Steven J. Murdoch. "Message Splitting Against the Partial Adversary". In Privacy Enhancing Technologies, 26–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11767831_3.
Texto completo da fonteSchmid, Ulrich, Manfred Schwarz e Kyrill Winkler. "On the Strongest Message Adversary for Consensus in Directed Dynamic Networks". In Structural Information and Communication Complexity, 102–20. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01325-7_13.
Texto completo da fonteChoudhury, Ashish, Kaoru Kurosawa e Arpita Patra. "Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary". In Applied Cryptography and Network Security, 292–308. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21554-4_17.
Texto completo da fonteSafavi-Naini, Reihaneh, e Mohammed Ashraful Alam Tuhin. "Bounds and Constructions for 1-Round (0,δ)-Secure Message Transmission against Generalized Adversary". In Progress in Cryptology - AFRICACRYPT 2012, 82–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31410-0_6.
Texto completo da fonteHunter, Aaron. "Dissecting the Meaning of an Encrypted Message: An Approach to Discovering the Goals of an Adversary". In Intelligence and Security Informatics, 61–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89900-6_9.
Texto completo da fonteOmolewa, Michael, Emmanuel Orihentare Eregare e Rose Eyefujinrin Ebohon. "Africa’s Response to Intangible Cultural Heritage Convention". In Heritage Studies, 113–24. Cham: Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-72123-6_7.
Texto completo da fonteHess, Daniel Baldwin, e Alex Bitterman. "Who Are the People in Your Gayborhood? Understanding Population Change and Cultural Shifts in LGBTQ+ Neighborhoods". In The Life and Afterlife of Gay Neighborhoods, 3–39. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-66073-4_1.
Texto completo da fonteBalasubramanian, Kannan. "Securing Public Key Encryption Against Adaptive Chosen Ciphertext Attacks". In Algorithmic Strategies for Solving Complex Problems in Cryptography, 134–44. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2915-6.ch011.
Texto completo da fonteLebovic, James H. "Commitment". In The False Promise of Superiority, 93—C4P103. Oxford University PressNew York, 2023. http://dx.doi.org/10.1093/oso/9780197680865.003.0004.
Texto completo da fonteWatkins, Calvert. "Preliminaries". In How to Kill a Dragon, 297–303. Oxford University PressNew York, NY, 1995. http://dx.doi.org/10.1093/oso/9780195085952.003.0027.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Message adversary"
Srinathan, Kannan, Arpita Patra, Ashish Choudhary e C. Pandu Rangan. "Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary". In the 4th International Symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1533057.1533083.
Texto completo da fonteBlacksttone, Jeremy, e Wayne Patterson. "Isolating Key Phrases to Identify Ransomware Attackers". In 13th International Conference on Applied Human Factors and Ergonomics (AHFE 2022). AHFE International, 2022. http://dx.doi.org/10.54941/ahfe1002200.
Texto completo da fontePatafta, Dominik, e Ines Milohnić. "CHALLENGES OF MANAGERIAL COMMUNICATION IN HOTEL BUSINESS OPERATIONS". In Tourism and hospitality industry. University of Rijeka, Faculty of Tourism and Hospitality Management, 2023. http://dx.doi.org/10.20867/thi.26.21.
Texto completo da fonteGurbuz, Mustafa. "PERFORMING MORAL OPPOSITION: MUSINGS ON THE STRATEGY AND IDENTITY IN THE GÜLEN MOVEMENT". In Muslim World in Transition: Contributions of the Gülen Movement. Leeds Metropolitan University Press, 2007. http://dx.doi.org/10.55207/hzit2119.
Texto completo da fonte