Ueli Maurer | |
|---|---|
 Ueli Maurer (2010) | |
| Born | 26 May 1960 |
| Awards | |
| Academic background | |
| Alma mater | Swiss Federal Institute of Technology Zurich |
| Thesis | Provable Security in Cryptography (1990) |
| Doctoral advisor | James Massey [1] |
| Academic work | |
| Discipline | Cryptography |
| Institutions | Swiss Federal Institute of Technology Zurich |
| Doctoral students | |
| Website | www |
Ueli Maurer (born 26 May 1960 [2] ) is a professor of cryptography at the Swiss Federal Institute of Technology Zurich (ETH Zurich).
Maurer studied electrical engineering at ETH Zurich and obtained his PhD in 1990, [2] advised by James Massey. [3] He joined Princeton University as a postdoc from 1990 to 1991. [2]
In a seminal work,he showed that the Diffie-Hellman problem is (under certain conditions) equivalent to solving the discrete log problem. [4]
From 2002 until 2008,Maurer also served on the board of Tamedia AG. [5]
Maurer was appointed editor-in-chief of the Journal of Cryptology in 2002 [6] for a three-year term. [7] He was reappointed to a second three-year term as editor-in-chief of the same journal from 2005. [8]
In 2008,Maurer was named a Fellow of the International Association for Cryptologic Research "for fundamental contributions to information-theoretic cryptography,service to the IACR,and sustained educational leadership in cryptology." [9] In 2015,he was named a Fellow of the Association for Computing Machinery "for contributions to cryptography and information security." [10] In 2016,he was awarded the RSA Award for Excellence in Mathematics. [11]
Ralph C. Merkle is an American computer scientist and mathematician. He is one of the inventors of public-key cryptography,the inventor of cryptographic hashing,and more recently a researcher and speaker on cryonics.
The International Association for Cryptologic Research (IACR) is a non-profit scientific organization that furthers research in cryptology and related fields. The IACR was organized at the initiative of David Chaum at the CRYPTO '82 conference.
Paul Carl Kocher is an American cryptographer and cryptography entrepreneur who founded Cryptography Research,Inc. (CRI) and served as its president and chief scientist.
The computational Diffie–Hellman (CDH) assumption is a computational hardness assumption about the Diffie–Hellman problem. The CDH assumption involves the problem of computing the discrete logarithm in cyclic groups. The CDH problem illustrates the attack of an eavesdropper in the Diffie–Hellman key exchange protocol to obtain the exchanged secret key.
The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman in the context of cryptography. The motivation for this problem is that many security systems use one-way functions:mathematical operations that are fast to compute,but hard to reverse. For example,they enable encrypting a message,but reversing the encryption is difficult. If solving the DHP were easy,these systems would be easily broken.
Victor Saul Miller is an American mathematician as a Principal Computer Scientist in the Computer Science Laboratory of SRI International. He received his B.A. in mathematics from Columbia University in 1968,and his Ph.D. in mathematics from Harvard University in 1975. He was an assistant professor in the Mathematics Department of the University of Massachusetts Boston from 1973 to 1978. In 1978 he joined the IBM 801 project in the Computer Science Department of the Thomas J. Watson Research Center in Yorktown Heights,New York,and moved to the Mathematics Department in 1984. From 1993-2022 he was on the Research Staff of Center for Communications Research (CCR) of the Institute for Defense Analyses in Princeton,New Jersey,U.S. In 2022 he was a Research Scientist in that Statistics and Privacy Group of Meta Platforms.
Dan Boneh is an Israeli–American professor in applied cryptography and computer security at Stanford University.
Rafail Ostrovsky is a distinguished professor of computer science and mathematics at UCLA and a well-known researcher in algorithms and cryptography.
Moni Naor 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.
Post-quantum cryptography (PQC),sometimes referred to as quantum-proof,quantum-safe or quantum-resistant,is the development of cryptographic algorithms that are thought to be secure against a cryptanalytic attack by a quantum computer. The problem with currently popular algorithms is that their security relies on one of three hard mathematical problems:the integer factorization problem,the discrete logarithm problem or the elliptic-curve discrete logarithm problem. All of these problems could be easily solved on a sufficiently powerful quantum computer running Shor's algorithm or even faster and less demanding alternatives.
Dr. Yvo G. Desmedt is the Jonsson Distinguished Professor at the University of Texas at Dallas,and in addition Chair of Information Communication Technology at University College London. He was a pioneer of threshold cryptography and is an International Association for Cryptologic Research Fellow. He also made crucial observations that were used in the cryptanalysis of the Merkle–Hellman knapsack cryptosystem and observed properties of the Data Encryption Standard which were used by Eli Biham and Adi Shamir when they invented Differential Cryptanalysis.
Mordechai M. "Moti" Yung is a cryptographer and computer scientist known for his work on cryptovirology and kleptography.
Tal Rabin is a computer scientist and Professor of Computer and Information Science at the University of Pennsylvania. She was previously the head of research at the Algorand Foundation and the head of the cryptography research group at IBM's Thomas J. Watson Research Center.
Amit Sahai is an Indian-American computer scientist. He is a professor of computer science at UCLA and the director of the Center for Encrypted Functionalities.
In cryptography,a public key exchange algorithm is a cryptographic algorithm which allows two parties to create and share a secret key,which they can use to encrypt messages between themselves. The ring learning with errors key exchange (RLWE-KEX) is one of a new class of public key exchange algorithms that are designed to be secure against an adversary that possesses a quantum computer. This is important because some public key algorithms in use today will be easily broken by a quantum computer if such computers are implemented. RLWE-KEX is one of a set of post-quantum cryptographic algorithms which are based on the difficulty of solving certain mathematical problems involving lattices. Unlike older lattice based cryptographic algorithms,the RLWE-KEX is provably reducible to a known hard problem in lattices.
Kenneth G. "Kenny" Paterson is a professor in the Institute of Information Security at ETH Zurich,where he leads the Applied Cryptography Group. Before joining ETH Zurich in April 2019,he was a professor in the Information Security Group at Royal Holloway,University of London and an EPSRC Leadership Fellow. He is a cryptographer with a focus on bridging the gap between theory and practice and recently became the Editor in Chief for the IACR's Journal of Cryptology and a 2017 fellow of the IACR.
Jan Leonhard Camenisch is a Swiss research scientist in cryptography and privacy and is currently the CTO of DFINITY. He previously worked at IBM Research –Zurich,Switzerland and has published over 100 widely cited scientific articles and holds more than 70 U.S. patents.
The RSA Conference (RSAC) Award for Excellence in Mathematics is an annual award. It is announced at the annual RSA Conference in recognition of innovations and contributions in the field of cryptography. An award committee of experts,which is associated with the Cryptographer's Track committee at the RSA Conference (CT-RSA),nominates to the award persons who are pioneers in their field,and whose work has had applied or theoretical lasting value;the award is typically given for the lifetime achievements throughout the nominee's entire career. Nominees are often affiliated with universities or involved with research and development in the information technology industry. The award is cosponsored by the International Association for Cryptologic Research.
Renato Renner is a Swiss professor for Theoretical Physics at the Swiss Federal Institute of Technology (ETH) in Zurich,where he is head of the Research Group for Quantum Information Theory. His research interests include Quantum Information and Computation,the Foundations of Quantum Physics and Quantum thermodynamics.
Hugo Krawczyk is an Argentine-Israeli cryptographer best known for co-inventing the HMAC message authentication algorithm and contributing in fundamental ways to the cryptographic architecture of central Internet standards,including IPsec,IKE,and SSL/TLS. In particular,both IKEv2 and TLS 1.3 use Krawczyk’s SIGMA protocol as the cryptographic core of their key exchange procedures. He has also contributed foundational work in the areas of threshold and proactive cryptosystems and searchable symmetric encryption,among others.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
