|
Provable Security
Provable security refers to any type or level of computer security that can be proved. It is used in different ways by different fields. Usually, this refers to mathematical proofs, which are common in cryptography. In such a proof, the capabilities of the attacker are defined by an adversarial model (also referred to as attacker model): the aim of the proof is to show that the attacker must solve the underlying hard problem in order to break the security of the modelled system. Such a proof generally does not consider side-channel attacks or other implementation-specific attacks, because they are usually impossible to model without implementing the system (and thus, the proof only applies to this implementation). Outside of cryptography, the term is often used in conjunction with secure coding and security by design, both of which can rely on proofs to show the security of a particular approach. As with the cryptographic setting, this involves an attacker model and a model of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Security
Computer security, cybersecurity (cyber security), or information technology security (IT security) is the protection of computer systems and networks from attack by malicious actors that may result in unauthorized information disclosure, theft of, or damage to hardware, software, or data, as well as from the disruption or misdirection of the services they provide. The field has become of significance due to the expanded reliance on computer systems, the Internet, and wireless network standards such as Bluetooth and Wi-Fi, and due to the growth of smart devices, including smartphones, televisions, and the various devices that constitute the Internet of things (IoT). Cybersecurity is one of the most significant challenges of the contemporary world, due to both the complexity of information systems and the societies they support. Security is of especially high importance for systems that govern large-scale systems with far-reaching physical effects, such as power distrib ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Silvio Micali
Silvio Micali (born October 13, 1954) is an Italian computer scientist, professor at the Massachusetts Institute of Technology and the founder of Algorand. Micali's research centers on cryptography and information security. In 2012, he received the Turing Award for his work in cryptography. Personal life Micali graduated in mathematics at La Sapienza University of Rome in 1978 and earned a PhD degree in computer science from the University of California, Berkeley in 1982; for research supervised by Manuel Blum. Micali has been on the faculty at MIT, Electrical Engineering and Computer Science Department, since 1983. His research interests are cryptography, zero knowledge, pseudorandom generation, secure protocols, and mechanism design. Career Micali is best known for some of his fundamental early work on public-key cryptosystems, pseudorandom functions, digital signatures, oblivious transfer, secure multiparty computation, and is one of the co-inventors of zero-knowledge ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Scott Aaronson
Scott Joel Aaronson (born May 21, 1981) is an American theoretical computer scientist and David J. Bruton Jr. Centennial Professor of Computer Science at the University of Texas at Austin. His primary areas of research are quantum computing and computational complexity theory. Early life and education Aaronson grew up in the United States, though he spent a year in Asia when his father—a science writer turned public-relations executive—was posted to Hong Kong. He enrolled in a school there that permitted him to skip ahead several years in math, but upon returning to the US, he found his education restrictive, getting bad grades and having run-ins with teachers. He enrolled in The Clarkson School, a gifted education program run by Clarkson University, which enabled Aaronson to apply for colleges while only in his freshman year of high school. He was accepted into Cornell University, where he obtained his BSc in computer science in 2000, [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
LNCS
''Lecture Notes in Computer Science'' is a series of computer science books published by Springer Science+Business Media since 1973. Overview The series contains proceedings, post-proceedings, monographs, and Festschrifts. In addition, tutorials, state-of-the-art surveys, and "hot topics" are increasingly being included. The series is indexed by DBLP. See also *''Monographiae Biologicae'', another monograph series published by Springer Science+Business Media *''Lecture Notes in Physics'' *''Lecture Notes in Mathematics'' *''Electronic Workshops in Computing'', published by the British Computer Society Sir Maurice Wilkes served as the first President of BCS in 1957 BCS, The Chartered Institute for IT, known as the British Computer Society until 2009, is a professional body and a learned society that represents those working in inf ... References External links * Publications established in 1973 Computer science books Series of non-fiction books Springer S ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Position Paper
A position paper (sometimes position piece for brief items) is an essay that presents an arguable opinion about an issue – typically that of the author or some specified entity. Position papers are published in academia, in politics, in law and other domains. The goal of a position paper is to convince the audience that the opinion presented is valid and worth listening to. Ideas for position papers that one is considering need to be carefully examined when choosing a topic, developing an argument, and organizing the paper. Position papers range from the simplest format of a letter to the editor, through to the most complex in the form of an academic position paper. Position papers are also used by large organizations to make public the official beliefs and recommendations of the group. In academia Position papers in academia enable discussion on emerging topics without the experimentation and original research normally present in an academic paper. Commonly, such a document ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ivan Damgård
Ivan Bjerre Damgård (born 1956) is a Danish cryptographer and currently a professor at the Department of Computer Science, Aarhus University, Denmark. Academic background In 1983, he obtained a master's degree in mathematics (with minors in music and computer science) at Aarhus University. He began his PhD studies in 1985 at the same university, and was for a period a guest researcher at CWI in Amsterdam in 1987. He earned his PhD degree in May, 1988, with the thesis ''Ubetinget beskyttelse i kryptografiske protokoller'' (Unconditional protection in cryptographic protocols) and has been employed at Aarhus University ever since. Damgård became full professor in 2005. Research Damgård co-invented the Merkle–Damgård construction, which is used in influential cryptographic hash functions such as SHA-2, SHA-1 and MD5. He discovered the structure independently of Ralph Merkle and published it in 1989. Ivan Damgård is one of the founders of the Cryptomathic Cryptomath ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Institute For Advanced Study
The Institute for Advanced Study (IAS), located in Princeton, New Jersey, in the United States, is an independent center for theoretical research and intellectual inquiry. It has served as the academic home of internationally preeminent scholars, including J. Robert Oppenheimer, Albert Einstein, Hermann Weyl, John von Neumann, and Kurt Gödel, many of whom had emigrated from Europe to the United States. It was founded in 1930 by American educator Abraham Flexner, together with philanthropists Louis Bamberger and Caroline Bamberger Fuld. Despite collaborative ties and neighboring geographic location, the institute, being independent, has "no formal links" with Princeton University. The institute does not charge tuition or fees. Flexner's guiding principle in founding the institute was the pursuit of knowledge for its own sake.Jogalekar. The faculty have no classes to teach. There are no degree programs or experimental facilities at the institute. Research is never contract ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Avi Wigderson
Avi Wigderson ( he, אבי ויגדרזון; born 9 September 1956) is an Israeli mathematician and computer scientist. He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton, New Jersey, United States of America. His research interests include complexity theory, parallel algorithms, graph theory, cryptography, distributed computing, and neural networks. Wigderson received the Abel Prize in 2021 for his work in theoretical computer science. Biography Avi Wigderson was born in Haifa, Israel, to Holocaust survivors. Wigderson is a graduate of the Hebrew Reali School in Haifa, and did his undergraduate studies at the Technion in Haifa, Israel, graduating in 1980, and went on to graduate study at Princeton University. He received his PhD in computer science in 1983 after completing a doctoral dissertation, titled "Studies in computational complexity", under the supervision of Richard Lipton. After short-term positions at ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jonathan Katz (computer Scientist)
Jonathan Katz is a professor in the Department of Computer Science at the University of Maryland who conducts research on cryptography and cybersecurity. In 2019–2020 he was a faculty member in the Volgenau School of Engineering at George Mason University, where he held the title of Eminent Scholar in Cybersecurity. In 2013–2019 he was director of the Maryland Cybersecurity Center at the University of Maryland. Biography Katz received BS degrees in mathematics and chemistry from MIT in 1996, followed by a master's degree in chemistry from Columbia University in 1998. After transferring to the computer science department, he received M.Phil. and PhD degrees in computer science from Columbia University in 2001 and 2002, respectively. Katz's doctoral advisors were Zvi Galil, Moti Yung, and Rafail Ostrovsky. While in graduate school, he worked as a research scientist at Telcordia Technologies (now ACS). Katz was on the faculty in the computer science department of the Univer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Oded Goldreich
Oded Goldreich ( he, עודד גולדרייך; b. 1957) is a professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel. His research interests lie within the theory of computation and are, specifically, the interplay of randomness and computation, the foundations of cryptography, and computational complexity theory. He won the Knuth Prize in 2017 and was selected in 2021 to receive the Israel Prize in mathematics. Biography Goldreich received a DSc in Computer Science at Technion in 1983 under Shimon Even. Goldreich has contributed to the development of pseudorandomness, zero knowledge proofs, secure function evaluation, property testing,Oded Goldreich, Shafi Goldwasser, and Dana Ron. 1998 Property Testing and its connection to Learning and Approximation. ''Journal of the ACM'', pages 653-750. and other areas in cryptography and computational complexity. Goldreich has also authored several books including: ' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Neal Koblitz
Neal I. Koblitz (born December 24, 1948) is a Professor of Mathematics at the University of Washington. He is also an adjunct professor with the Centre for Applied Cryptographic Research at the University of Waterloo. He is the creator of hyperelliptic curve cryptography and the independent co-creator of elliptic curve cryptography. Biography Koblitz received his undergraduate degree from Harvard University in 1969. While at Harvard, he was a Putnam Fellow in 1968. He received his Ph.D. from Princeton University in 1974 under the direction of Nick Katz. From 1975 to 1979 he was an instructor at Harvard University. In 1979 he began working at the University of Washington. Koblitz's 1981 article "Mathematics as Propaganda" criticized the misuse of mathematics in the social sciences and helped motivate Serge Lang's successful challenge to the nomination of political scientist Samuel P. Huntington to the National Academy of Sciences. In ''The Mathematical Intelligencer'', K ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
One-way Function
In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here, "easy" and "hard" are to be understood in the sense of computational complexity theory, specifically the theory of polynomial time problems. Not being one-to-one is not considered sufficient for a function to be called one-way (see Theoretical definition, below). The existence of such one-way functions is still an open conjecture. Their existence would prove that the complexity classes P and NP are not equal, thus resolving the foremost unsolved question of theoretical computer science. Oded Goldreich (2001). Foundations of Cryptography: Volume 1, Basic Tools,draft availablefrom author's site). Cambridge University Press. . (see als The converse is not known to be true, i.e. the existence of a proof that P≠NP would not directly imply the existence of one-way functions. In applied contexts, the terms "easy" and "hard" ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
