|
Rafail Ostrovsky
Rafail Ostrovsky is a distinguished professor of computer science and mathematics at UCLA and a well-known researcher in algorithms and cryptography. Biography Rafail Ostrovsky received his Ph.D. from MIT in 1992. He is a member of the editorial board of Algorithmica Editorial Board of Journal of Cryptologand Editorial and Advisory Board of the International Journal of Information and Computer Securit Awards * 2021 ACM Fellow for "contributions to the foundations of cryptography" * 2018 RSA Award for Excellence in Mathematics * 2006 IBM Faculty Award * 2006 and 2005 Xerox Innovation Group Award * 2004 OKAWA Research Award; the 1993 Henry Taub Prize * 1999, 2001, and 2002 best published work of the year at SAIC in computer science and mathematics. * 1996 Bellcore prize for excellence in research Publications Some of Ostrovsky's contributions to computer science include: * 1990 Introduced (with R. Venkatesan and M. Yung) the notion o''interactive hashing'' proved essential f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Americans
Americans are the citizens and nationals of the United States of America.; ; Although direct citizens and nationals make up the majority of Americans, many dual citizens, expatriates, and permanent residents could also legally claim American nationality. The United States is home to people of many racial and ethnic origins; consequently, American culture and law do not equate nationality with race or ethnicity, but with citizenship and an oath of permanent allegiance. Overview The majority of Americans or their ancestors immigrated to the United States or are descended from people who were brought as slaves within the past five centuries, with the exception of the Native American population and people from Hawaii, Puerto Rico, Guam, and the Philippine Islands, who became American through expansion of the country in the 19th century, additionally America expanded into American Samoa, the U.S. Virgin Islands and Northern Mariana Islands in the 20th century. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shafi Goldwasser
en, Shafrira Goldwasser , name = Shafi Goldwasser , image = Shafi Goldwasser.JPG , caption = Shafi Goldwasser in 2010 , birth_place = New York City, New York, U.S. , birth_date = , death_date = , death_place = , nationality = Israeli American , field = Computer science, cryptography , work_institution = , alma_mater = , doctoral_advisor = Manuel Blum , thesis_title = Probabilistic Encryption: Theory and Applications , thesis_url = http://search.proquest.com/docview/303337869 , thesis_year = 1984 , doctoral_students = , known_for = , prizes = , website = Shafrira Goldwasser ( he, שפרירה גולדווסר; born 1959) is an Israeli-American computer scientist and winner of the Turing Award in 2012. She is the RSA Professor of Electrical Engineering and Computer Science at MIT, a professor of mathematical sciences ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
American Computer Scientists
American(s) may refer to: * American, something of, from, or related to the United States of America, commonly known as the "United States" or "America" ** Americans, citizens and nationals of the United States of America ** American ancestry, people who self-identify their ancestry as "American" ** American English, the set of varieties of the English language native to the United States ** Native Americans in the United States, indigenous peoples of the United States * American, something of, from, or related to the Americas, also known as "America" ** Indigenous peoples of the Americas * American (word), for analysis and history of the meanings in various contexts Organizations * American Airlines, U.S.-based airline headquartered in Fort Worth, Texas * American Athletic Conference, an American college athletic conference * American Recordings (record label), a record label previously known as Def American * American University, in Washington, D.C. Sports teams Soccer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1963 Births
Events January * January 1 – Bogle–Chandler case: Commonwealth Scientific and Industrial Research Organisation scientist Dr. Gilbert Bogle and Mrs. Margaret Chandler are found dead (presumed poisoned), in bushland near the Lane Cove River, Sydney, Australia. * January 2 – Vietnam War – Battle of Ap Bac: The Viet Cong win their first major victory. * January 9 – A January 1963 lunar eclipse, total penumbral lunar eclipse is visible in the Americas, Europe, Africa, and Asia, and is the 56th lunar eclipse of Lunar Saros 114. Gamma has a value of −1.01282. It occurs on the night between Wednesday, January 9 and Thursday, January 10, 1963. * January 13 – 1963 Togolese coup d'état: A military coup in Togo results in the installation of coup leader Emmanuel Bodjollé as president. * January 17 – A last quarter moon occurs between the January 1963 lunar eclipse, penumbral lunar eclipse and the Solar eclipse of January 25, 1963, annular solar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Space
Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, that is, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are Euclidean spaces of any positive integer dimension, including the three-dimensional space and the ''Euclidean plane'' (dimension two). The qualifier "Euclidean" is used to distinguish Euclidean spaces from other spaces that were later considered in physics and modern mathematics. Ancient Greek geometers introduced Euclidean space for modeling the physical space. Their work was collected by the ancient Greek mathematician Euclid in his ''Elements'', with the great innovation of '' proving'' all properties of the space as theorems, by starting from a few fundamental properties, called ''postulates'', which either were considered as evident (for example, there is exactly one straight line passing through two points), or seemed impossible to prove (paral ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Norm (mathematics)
In mathematics, a norm is a function from a real or complex vector space to the non-negative real numbers that behaves in certain ways like the distance from the origin: it commutes with scaling, obeys a form of the triangle inequality, and is zero only at the origin. In particular, the Euclidean distance of a vector from the origin is a norm, called the Euclidean norm, or 2-norm, which may also be defined as the square root of the inner product of a vector with itself. A seminorm satisfies the first two properties of a norm, but may be zero for vectors other than the origin. A vector space with a specified norm is called a normed vector space. In a similar manner, a vector space with a seminorm is called a ''seminormed vector space''. The term pseudonorm has been used for several related meanings. It may be a synonym of "seminorm". A pseudonorm may satisfy the same axioms as a norm, with the equality replaced by an inequality "\,\leq\," in the homogeneity axiom. It ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nearest Neighbor Search
Nearest neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most similar) to a given point. Closeness is typically expressed in terms of a dissimilarity function: the less similar the objects, the larger the function values. Formally, the nearest-neighbor (NN) search problem is defined as follows: given a set ''S'' of points in a space ''M'' and a query point ''q'' ∈ ''M'', find the closest point in ''S'' to ''q''. Donald Knuth in vol. 3 of ''The Art of Computer Programming'' (1973) called it the post-office problem, referring to an application of assigning to a residence the nearest post office. A direct generalization of this problem is a ''k''-NN search, where we need to find the ''k'' closest points. Most commonly ''M'' is a metric space and dissimilarity is expressed as a distance metric, which is symmetric and satisfies the triangle inequality. Even more common, ''M'' is taken ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Private Information Retrieval
In cryptography, a private information retrieval (PIR) protocol is a protocol that allows a user to retrieve an item from a server in possession of a database without revealing which item is retrieved. PIR is a weaker version of 1-out-of-''n'' oblivious transfer, where it is also required that the user should not get information about other database items. One trivial, but very inefficient way to achieve PIR is for the server to send an entire copy of the database to the user. In fact, this is the only possible protocol (in the classical or the quantum setting) that gives the user information theoretic privacy for their query in a single-server setting. There are two ways to address this problem: make the server computationally bounded or assume that there are multiple non-cooperating servers, each having a copy of the database. The problem was introduced in 1995 by Chor, Goldreich, Kushilevitz and Sudan in the information-theoretic setting and in 1997 by Kushilevitz and Ostrovs ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Deniable Encryption
In cryptography and steganography, plausibly deniable encryption describes encryption techniques where the existence of an encrypted file or message is deniable in the sense that an adversary cannot prove that the plaintext data exists. The users may convincingly deny that a given piece of data is encrypted, or that they are able to decrypt a given piece of encrypted data, or that some specific encrypted data exists. Such denials may or may not be genuine. For example, it may be impossible to prove that the data is encrypted without the cooperation of the users. If the data is encrypted, the users genuinely may not be able to decrypt it. Deniable encryption serves to undermine an attacker's confidence either that data is encrypted, or that the person in possession of it can decrypt it and provide the associated plaintext. Function Deniable encryption makes it impossible to prove the existence of the plaintext message without the proper decryption key. This may be done by allowing ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Moni Naor
Moni Naor ( he, מוני נאור) is an Israeli computer scientist, currently a professor at the Weizmann Institute of Science. Naor received his Ph.D. in 1989 at the University of California, Berkeley. His advisor was Manuel Blum. He works in various fields of computer science, mainly the foundations of cryptography. He is notable for initiating research on public key systems secure against chosen ciphertext attack and creating non-malleable cryptography, visual cryptography (with Adi Shamir), and suggesting various methods for verifying that users of a computer system are human (leading to the notion of CAPTCHA). His research on Small-bias sample space, give a general framework for combining small k-wise independent spaces with small \epsilon-biased spaces to obtain \delta-almost k-wise independent spaces of small size. In 1994 he was the first, with Amos Fiat, to formally study the problem of practical broadcast encryption. Along with Benny Chor, Amos Fiat, and Benny Pin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cynthia Dwork
Cynthia Dwork (born June 27, 1958) is an American computer scientist at Harvard University, where she is Gordon McKay Professor of Computer Science, Radcliffe Alumnae Professor at the Radcliffe Institute for Advanced Study, and Affiliated Professor, Harvard Law School and Harvard's Department of Statistics. Dwork was elected a member of the National Academy of Engineering in 2008 for fundamental contributions to distributed algorithms and the security of cryptosystems. She is a distinguished scientist at Microsoft Research. Early life and education Dwork received her B.S.E. from Princeton University in 1979, graduating Cum Laude, and receiving the Charles Ira Young Award for Excellence in Independent Research. Dwork received her Ph.D. from Cornell University in 1983 for research supervised by John Hopcroft. Career and research Dwork is known for her research placing privacy-preserving data analysis on a mathematically rigorous foundation, including the co-invention of differen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
