Boaz Tsaban | |
|---|---|
בועז צבאן | |
 | |
| Born | 6 February 1973 |
| Nationality | Israeli |
| Awards | Nessyahu prize,Wolf Foundation Krill Prize |
| Scientific career | |
| Fields | Mathematics |
| Institutions | Bar Ilan University |
| Doctoral advisor | Hillel Furstenberg |
Boaz Tsaban (born February 1973) is an Israeli mathematician on the faculty of Bar-Ilan University. His research interests include selection principles within set theory and nonabelian cryptology, within mathematical cryptology.
Boaz Tsaban grew up in Or Yehuda, a city near Tel Aviv. At the age of 16 he was selected with other high school students to attend the first cycle of a special preparation program in mathematics, at Bar-Ilan University, being admitted to regular mathematics courses at the University a year later. He completed his B.Sc., M.Sc. and Ph.D. [1] degrees with highest distinctions. Two years as a post-doctoral fellow at Hebrew University were followed by a three-year Koshland Fellowship at the Weizmann Institute of Science before he joined the Department of Mathematics, Bar-Ilan University in 2007.
In the field of selection principles, Tsaban devised the method of omission of intervals [2] for establishing covering properties of sets of real numbers that have certain combinatorial structures. In nonabelian cryptology he devised the algebraic span method [3] [4] that solved a number of computational problems that underlie a number of proposals for nonabelian public-key cryptographic schemes (such as the commutator key exchange).
Tsaban's doctoral dissertation, supervised by Hillel Furstenberg, won, with Irit Dinur, the Nessyahu prize [5] for the best Ph.D. in mathematics in Israel in 2003. In 2009 he won the Wolf Foundation Krill Prize [6] for Excellence in Scientific Research.
In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of computational methods for investigating and solving problems in number theory and arithmetic geometry, including algorithms for primality testing and integer factorization, finding solutions to diophantine equations, and explicit methods in arithmetic geometry. Computational number theory has applications to cryptography, including RSA, elliptic curve cryptography and post-quantum cryptography, and is used to investigate conjectures and open problems in number theory, including the Riemann hypothesis, the Birch and Swinnerton-Dyer conjecture, the ABC conjecture, the modularity conjecture, the Sato-Tate conjecture, and explicit aspects of the Langlands program.
Provable security refers to any type or level of computer security that can be proved. It is used in different ways by different fields.
Artur Konrad Ekert is a British-Polish professor of quantum physics at the Mathematical Institute, University of Oxford, professorial fellow in quantum physics and cryptography at Merton College, Oxford, Lee Kong Chian Centennial Professor at the National University of Singapore and the founding director of the Centre for Quantum Technologies (CQT). His research interests extend over most aspects of information processing in quantum-mechanical systems, with a focus on quantum communication and quantum computation. He is best known as one of the pioneers of quantum cryptography.
Nicolas Tadeusz Courtois is a cryptographer and senior lecturer in computer science at University College London.
Smale's problems are a list of eighteen unsolved problems in mathematics proposed by Steve Smale in 1998 and republished in 1999. Smale composed this list in reply to a request from Vladimir Arnold, then vice-president of the International Mathematical Union, who asked several mathematicians to propose a list of problems for the 21st century. Arnold's inspiration came from the list of Hilbert's problems that had been published at the beginning of the 20th century.
Lattice-based cryptography is the generic term for constructions of cryptographic primitives that involve lattices, either in the construction itself or in the security proof. Lattice-based constructions are currently important candidates for post-quantum cryptography. Unlike more widely used and known public-key schemes such as the RSA, Diffie-Hellman or elliptic-curve cryptosystems—which could, theoretically, be defeated using Shor's algorithm on a quantum computer—some lattice-based constructions appear to be resistant to attack by both classical and quantum computers. Furthermore, many lattice-based constructions are considered to be secure under the assumption that certain well-studied computational lattice problems cannot be solved efficiently.
Group-based cryptography is a use of groups to construct cryptographic primitives. A group is a very general algebraic object and most cryptographic schemes use groups in some way. In particular Diffie–Hellman key exchange uses finite cyclic groups. So the term group-based cryptography refers mostly to cryptographic protocols that use infinite nonabelian groups such as a braid group.
Yehuda Lindell is a professor in the Department of Computer Science at Bar-Ilan University where he conducts research on cryptography with a focus on the theory of secure computation and its application in practice. Lindell currently leads the cryptography team at Coinbase.
Harald G. Niederreiter is an Austrian mathematician known for his work in discrepancy theory, algebraic geometry, quasi-Monte Carlo methods, and cryptography.
Algebraic Eraser (AE) is an anonymous key agreement protocol that allows two parties, each having an AE public–private key pair, to establish a shared secret over an insecure channel. This shared secret may be directly used as a key, or to derive another key that can then be used to encrypt subsequent communications using a symmetric key cipher. Algebraic Eraser was developed by Iris Anshel, Michael Anshel, Dorian Goldfeld and Stephane Lemieux. SecureRF owns patents covering the protocol and unsuccessfully attempted to standardize the protocol as part of ISO/IEC 29167-20, a standard for securing radio-frequency identification devices and wireless sensor networks.
Carlos Tschudi Simpson is an American mathematician, specializing in algebraic geometry.
Marion Scheepers is a South African-born mathematician, lecturer and researcher in the Department of Mathematics of Boise State University in Boise, Idaho since 1988. He is particularly known for his work on selection principles and on infinite topological and set-theoretical games. He introduced themes that are common to many selection principles and is responsible for the Scheepers diagram.
Oded Regev is an Israeli-American theoretical computer scientist and mathematician. He is a professor of computer science at the Courant institute at New York University. He is best known for his work in lattice-based cryptography, and in particular for introducing the learning with errors problem.
Adrian Kent is a British theoretical physicist, Professor of Quantum Physics at the University of Cambridge, member of the Centre for Quantum Information and Foundations, and Distinguished Visiting Research Chair at the Perimeter Institute for Theoretical Physics. His research areas are the foundations of quantum theory, quantum information science and quantum cryptography. He is known as the inventor of relativistic quantum cryptography. In 1999 he published the first unconditionally secure protocols for bit commitment and coin tossing, which were also the first relativistic cryptographic protocols. He is a co-inventor of quantum tagging, or quantum position authentication, providing the first schemes for position-based quantum cryptography. In 2005 he published with Lucien Hardy and Jonathan Barrett the first security proof of quantum key distribution based on the no-signalling principle.
Beresford Neill Parlett is an English applied mathematician, specializing in numerical analysis and scientific computation.
Orr Dunkelman is an Israeli cryptographer and cryptanalyst, currently a professor at the University of Haifa Computer Science department. Dunkelman is a co-director of the Center for Cyber Law & Privacy at the University of Haifa and a co-founder of Privacy Israel, an Israeli NGO for promoting privacy in Israel.
Klaus Fredenhagen is a German theoretical physicist who works on the mathematical foundations of quantum field theory.
James Milton Renegar Jr. is an American mathematician, specializing in optimization algorithms for linear programming and nonlinear programming.
Tsachik Gelander is an Israeli mathematician working in the fields of Lie groups, topological groups, symmetric spaces, lattices and discrete subgroups. He is a professor in Northwestern University.
Zvi Lotker is an Israeli computer scientist and communications systems engineer who works in the fields of digital humanities, artificial intelligence, distributed computing, network algorithms, and communication networks. He is an associate professor in the Alexander Kofkin Faculty of Engineering at Bar-Ilan University.
| International | |
|---|---|
| National | |
| Academics | |
