Gotowa bibliografia na temat „Everlasting Security”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Everlasting Security”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Everlasting Security"
Aumann, Y., Yan Zong Ding i M. O. Rabin. "Everlasting security in the bounded storage model". IEEE Transactions on Information Theory 48, nr 6 (czerwiec 2002): 1668–80. http://dx.doi.org/10.1109/tit.2002.1003845.
Pełny tekst źródłaHaines, Thomas, Rafieh Mosaheb, Johannes Müller i Ivan Pryvalov. "SoK: Secure E-Voting with Everlasting Privacy". Proceedings on Privacy Enhancing Technologies 2023, nr 1 (styczeń 2023): 279–93. http://dx.doi.org/10.56553/popets-2023-0017.
Pełny tekst źródłaPathak, Ram Kripal, i Ram Awadh Ram. "Cosmic Farming: A Ray of Hope for Sustainable Horticulture Production and Health Security". INTERNATIONAL JOURNAL OF PLANT AND ENVIRONMENT 6, nr 04 (30.12.2020): 225–40. http://dx.doi.org/10.18811/ijpen.v6i04.01.
Pełny tekst źródłaBibak, Khodakhast, Robert Ritchie i Behrouz Zolfaghari. "Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash". quantum Information and Computation 21, nr 3&4 (marzec 2021): 0181–202. http://dx.doi.org/10.26421/qic21.3-4-1.
Pełny tekst źródłaSheikholeslami, Azadeh, Dennis Goeckel i Hossein Pishro-Nik. "Jamming Based on an Ephemeral Key to Obtain Everlasting Security in Wireless Environments". IEEE Transactions on Wireless Communications 14, nr 11 (listopad 2015): 6072–81. http://dx.doi.org/10.1109/twc.2015.2448074.
Pełny tekst źródłaSudha Gadde, Sai, Rama Krishna Srinivas Ganta, ASALG Gopala Gupta, Raghava Rao K i KRR Mohan Rao. "Securing Internet of Things(IoT) Using HoneyPots". International Journal of Engineering & Technology 7, nr 2.7 (18.03.2018): 820. http://dx.doi.org/10.14419/ijet.v7i2.7.11075.
Pełny tekst źródłaQuerejeta-Azurmendi, Iñigo, David Arroyo Guardeño, Jorge L. Hernández-Ardieta i Luis Hernández Encinas. "NetVote: A Strict-Coercion Resistance Re-Voting Based Internet Voting Scheme with Linear Filtering". Mathematics 8, nr 9 (18.09.2020): 1618. http://dx.doi.org/10.3390/math8091618.
Pełny tekst źródłaJamal, Ayesha, Muhammad Faisal Hayat i Muhammad Nasir. "Malware Detection and Classification in IoT Network using ANN". Mehran University Research Journal of Engineering and Technology 41, nr 1 (1.01.2022): 80–91. http://dx.doi.org/10.22581/muet1982.2201.08.
Pełny tekst źródłaMohammed Isa, Ibrahim. "Repositioning Science and Technology Education for Security and National Economic Growth and Development in Nigeria". International Journal of Asian Education 3, nr 3 (20.09.2022): 205–10. http://dx.doi.org/10.46966/ijae.v3i3.293.
Pełny tekst źródłaErdem, S. Altan. "Maintaining The Security In Internet Marketing: Moving From Biometrics To Behaviometrics". Review of Business Information Systems (RBIS) 15, nr 3 (29.07.2011): 43–48. http://dx.doi.org/10.19030/rbis.v15i3.5401.
Pełny tekst źródłaRozprawy doktorskie na temat "Everlasting Security"
Vyas, Nilesh. "Quantum cryptography in a hybrid security model". Electronic Thesis or Diss., Institut polytechnique de Paris, 2021. http://www.theses.fr/2021IPPAT049.
Pełny tekst źródłaExtending the functionality and overcoming the performance limitation of QKD requires either quantum repeaters or new security models. Investigating the latter option, we introduce the Quantum Computational Timelock (QCT) security model, assuming that computationally secure encryption may only be broken after time much longer than the coherence time of available quantum memories. These two assumptions, namely short-term computational security and noisy quantum storage, have so far already been considered in quantum cryptography, yet only disjointly. A practical lower bound on time, for which encryption is computationally secure, can be inferred from assumed long-term security of the AES256 encryption scheme (30 years) and the value of coherence time in experimental demonstrations of storage and then retrieval of optically encoded quantum information, at single-photon level range from a few nanoseconds to microseconds. Given the large gap between the upper bound on coherence time and lower bound on computational security time of an encryption scheme, the validity of the QCT security model can be assumed with a very high confidence today and also leaves a considerable margin for its validity in the future. Using the QCT security model, we propose an explicit d-dimensional key agreement protocol that we call MUB-Quantum Computational Timelock (MUB-QCT), where a bit is encoded on a qudit state using a full set of mutually unbiased bases (MUBs) and a family of pair-wise independent permutations. Security is proved by showing that upper bound on Eve's information scales as O(1=d). We show MUB-QCT offers: high resilience to error (up to 50% for large d) with fixed hardware requirements; MDI security as security is independent of channel monitoring and does not require to trust measurement devices. We also prove the security of the MUB-QCT protocol, with multiple photons per channel use, against non-adaptive attacks, in particular, proactive MUB measurement where eve measures each copy in a different MUB followed by post-measurement decoding. We prove that the MUB-QCT protocol allows secure key distribution with input states containing up to O(d) photons which implies a significant performance boost, characterized by an O(d) multiplication of key rate and a significant increase in the reachable distance. These results illustrate the power of the QCT security model to boost the performance of quantum cryptography while keeping a clear security advantage over classical cryptography
Voyevoda, Andriy. "The european energy union : an inevitable path or an everlasting chimera?" Master's thesis, Instituto Superior de Economia e Gestão, 2020. http://hdl.handle.net/10400.5/20712.
Pełny tekst źródłaA integração gradual na Europa tem sido um lento mas constante processo, um processo que permitiu à União Europeia (UE) prosseguir iniciativas comuns nas esferas política e económica. Estas iniciativas permitiram o estabelecimento de um mercado comum de bens e serviços, uma união monetária, instituições políticas comuns, posições comuns em termos de política externa, entre outros aspetos que reforçaram a natureza sui generis da União Europeia enquanto organização supranacional . Apesar de um relativo sucesso nestas várias dimensões, o projeto europeu carece, ainda, de uma estratégia comum para a energia, o que é uma enorme desvantagem tendo em conta que a UE é altamente dependente de importações de combustíveis fósseis para satisfazer o seu crescimento económico. Com grande potencial para uma política comum no futuro, a agenda energética europeia não evoluiu ainda para o mesmo nível de integração que as políticas económicas e monetária, por exemplo. Deste modo, a presente dissertação focar-se-á na formulação da União da Energia Europeia, procurando analisar as diversas iniciativas adotadas pela UE para a concretização de uma estratégia energética comum.
The gradual integration in Europe has been a slow but steady process, a process that allowed the European Union (EU) to pursue common policies within the economic and political spheres. Such policies led to the establishment of a single market for goods and services, a monetary union, common political institutions, common standpoints in terms of foreign policy, and other shared aspects that added to the sui generis nature of the European Union as a supranational organization. Despite this relative success within a variety of policy dimensions, the European project still lacks a common strategy for energy, which is a huge liability given the fact that the Union, as a whole, is highly dependent on fossil fuels imports to satisfy its energy-hungry economic growth. With great potential for a future common stance, the European energy agenda has not yet evolved to the same integration level as the economic and monetary policies have, for instance. As such, the present dissertation focuses on the formation of the European Energy Union, seeking to analyze the several strategies partaken by the EU in order to complete a common energy strategy.
info:eu-repo/semantics/publishedVersion
Książki na temat "Everlasting Security"
The Hot Dog Syndrome: Everlasting Strategies for Obtaining Money, Enjoyment and Security from Your Business. Granville Publications, 2002.
Znajdź pełny tekst źródłaBerg, Adriane G. How Not to Go Broke at 102!: Achieving Everlasting Wealth. Wiley, 2004.
Znajdź pełny tekst źródłaBerg, Adriane G. How Not to Go Broke at 102!: Achieving Everlasting Wealth. Wiley, 2008.
Znajdź pełny tekst źródłaCzęści książek na temat "Everlasting Security"
Ding, Yan Zong, i Michael O. Rabin. "Hyper-Encryption and Everlasting Security". W STACS 2002, 1–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45841-7_1.
Pełny tekst źródłaKario, Hubert. "Everlasting ROBOT: The Marvin Attack". W Computer Security – ESORICS 2023, 243–62. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-51479-1_13.
Pełny tekst źródłaLocher, Philipp, Rolf Haenni i Reto E. Koenig. "Coercion-Resistant Internet Voting with Everlasting Privacy". W Financial Cryptography and Data Security, 161–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-53357-4_11.
Pełny tekst źródłaGarman, Christina, Matthew Green, Ian Miers i Aviel D. Rubin. "Rational Zero: Economic Security for Zerocoin with Everlasting Anonymity". W Financial Cryptography and Data Security, 140–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44774-1_10.
Pełny tekst źródłaBuchmann, Johannes, Denise Demirel i Jeroen van de Graaf. "Towards a Publicly-Verifiable Mix-Net Providing Everlasting Privacy". W Financial Cryptography and Data Security, 197–204. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39884-1_16.
Pełny tekst źródłaPereira, Olivier, i Peter B. Rønne. "End-to-End Verifiable Quadratic Voting with Everlasting Privacy". W Financial Cryptography and Data Security, 314–29. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43725-1_22.
Pełny tekst źródłaChen, Xiaofeng, Fangguo Zhang, Haibo Tian, Qianhong Wu, Yi Mu, Jangseong Kim i Kwangjo Kim. "Three-Round Abuse-Free Optimistic Contract Signing with Everlasting Secrecy". W Financial Cryptography and Data Security, 304–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14577-3_23.
Pełny tekst źródłaHarnik, Danny, i Moni Naor. "On Everlasting Security in the Hybrid Bounded Storage Model". W Automata, Languages and Programming, 192–203. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11787006_17.
Pełny tekst źródłaGrontas, Panagiotis, Aris Pagourtzis, Alexandros Zacharakis i Bingsheng Zhang. "Towards Everlasting Privacy and Efficient Coercion Resistance in Remote Electronic Voting". W Financial Cryptography and Data Security, 210–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. http://dx.doi.org/10.1007/978-3-662-58820-8_15.
Pełny tekst źródłaApplebaum, Benny, Eliran Kachlon i Arpita Patra. "Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security". W Theory of Cryptography, 103–20. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-22365-5_4.
Pełny tekst źródła