|
Amos Fiat
Amos Fiat (born December 1, 1956) is an Israeli computer scientist, a professor of computer science at Tel Aviv University. He is known for his work in cryptography, online algorithms, and algorithmic game theory. Biography Fiat earned his Ph.D. in 1987 from the Weizmann Institute of Science under the supervision of Adi Shamir. After postdoctoral studies with Richard Karp and Manuel Blum at the University of California, Berkeley, he returned to Israel, taking a faculty position at Tel Aviv University. Research Many of Fiat's most highly cited publications concern cryptography, including his work with Adi Shamir on digital signatures (leading to the Fiat–Shamir heuristic for turning interactive identification protocols into signature schemes) and his work with David Chaum and Moni Naor on electronic money, used as the basis for the ecash system. With Shamir and Uriel Feige in 1988, Fiat invented the Feige–Fiat–Shamir identification scheme, a method for using public-key crypt ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Haifa
Haifa ( he, חֵיפָה ' ; ar, حَيْفَا ') is the third-largest city in Israel—after Jerusalem and Tel Aviv—with a population of in . The city of Haifa forms part of the Haifa metropolitan area, the third-most populous metropolitan area in Israel. It is home to the Baháʼí Faith's Baháʼí World Centre, and is a UNESCO World Heritage Site and a destination for Baháʼí pilgrimage. Built on the slopes of Mount Carmel, the settlement has a history spanning more than 3,000 years. The earliest known settlement in the vicinity was Tell Abu Hawam, a small port city established in the Late Bronze Age (14th century BCE). Encyclopedia Judaica, ''Haifa'', Keter Publishing, Jerusalem, 1972, vol. 7, pp. 1134–1139 In the 3rd century CE, Haifa was known as a dye-making center. Over the millennia, the Haifa area has changed hands: being conquered and ruled by the Canaanites, Israelites, Phoenicians, Assyrians, Babylonians, Persians, Hasmoneans, Romans, Byzant ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David Chaum
David Lee Chaum (born 1955) is an American computer scientist, cryptographer, and inventor. He is known as a pioneer in cryptography and privacy-preserving technologies, and widely recognized as the inventor of digital cash. His 1982 dissertation "Computer Systems Established, Maintained, and Trusted by Mutually Suspicious Groups" is the first known proposal for a blockchain protocol. Complete with the code to implement the protocol, Chaum's dissertation proposed all but one element of the blockchain later detailed in the Bitcoin whitepaper. He has been referred to as "the father of online anonymity", and "the godfather of cryptocurrency". He is also known for developing ecash, an electronic cash application that aims to preserve a user's anonymity, and inventing many cryptographic protocols like the blind signature, mix networks and the Dining cryptographers protocol. In 1995 his company DigiCash created the first digital currency with eCash.Greenberg, Andy (2012). ''This ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dagstuhl
Dagstuhl is a computer science research center in Germany, located in and named after a district of the town of Wadern, Merzig-Wadern, Saarland. Location Following the model of the mathematical center at Oberwolfach, the center is installed in a very remote and relaxed location in the countryside. The Leibniz Center is located in a historic country house, Schloss Dagstuhl (Dagstuhl Castle), together with modern purpose-built buildings connected by an enclosed footbridge. The ruins of the 13th-century Dagstuhl Castle are nearby, a short walk up a hill from the Schloss. History The Leibniz-Zentrum für Informatik (LZI, ''Leibniz Center for Informatics'') was established at Dagstuhl in 1990. In 1993, the over 200-year-old building received a modern extension with other guest rooms, conference rooms and a library. The center is managed as a non-profit organization, and financed by national funds. It receives scientific support by a variety of German and foreign research institut ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gerhard Woeginger
Gerhard J. Woeginger (31 May 1964 – 1 April 2022) was an Austrian mathematician and computer scientist who worked in Germany as a professor at RWTH Aachen University, where he chaired the algorithms and complexity group in the department of computer science. Biography Woeginger was born on 31 May 1964 in Graz, Austria. He obtained a diploma from the Graz University of Technology (TU Graz) in 1987, and completed his Ph.D. at TU Graz 1991 under the supervision of Franz Rendl. He worked on the faculty of TU Graz from 1991 to 2001, where he completed his habilitation in 1995. He then moved to the University of Twente from 2001 to 2004, to TU Eindhoven, from 2004 to 2016, and finally to RWTH Aachen in 2016. He was program chair of the European Symposium on Algorithms in 1997, of the algorithms track of the International Colloquium on Automata, Languages and Programming in 2003, of the European Conference on Operational Research in 2009, and of several other conferences. In 1996 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Copy Protection
Copy protection, also known as content protection, copy prevention and copy restriction, describes measures to enforce copyright by preventing the reproduction of software, films, music, and other media. Copy protection is most commonly found on videotapes, DVDs, Blu-ray discs, HD-DVDs, computer software discs, video game discs and cartridges, audio CDs and some VCDs. Some methods of copy protection have also led to criticism because it caused inconvenience for paying consumers or secretly installed additional or unwanted software to detect copying activities on the consumer's computer. Making copy protection effective while protecting consumer rights remains a problem with media publication. Terminology Media corporations have always used the term copy protection, but critics argue that the term tends to sway the public into identifying with the publishers, who favor restriction technologies, rather than with the users. Copy prevention and copy control may be more neutr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Copyright Infringement
Copyright infringement (at times referred to as piracy) is the use of works protected by copyright without permission for a usage where such permission is required, thereby infringing certain exclusive rights granted to the copyright holder, such as the right to reproduce, distribute, display or perform the protected work, or to make derivative works. The copyright holder is typically the work's creator, or a publisher or other business to whom copyright has been assigned. Copyright holders routinely invoke legal and technological measures to prevent and penalize copyright infringement. Copyright infringement disputes are usually resolved through direct negotiation, a notice and take down process, or litigation in civil court. Egregious or large-scale commercial infringement, especially when it involves counterfeiting, is sometimes prosecuted via the criminal justice system. Shifting public expectations, advances in digital technology and the increasing reach of the Internet ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Traitor Tracing
Traitor tracing schemes help trace the source of leaks when secret or proprietary data is sold to many customers. In a traitor tracing scheme, each customer is given a different personal decryption key. (Traitor tracing schemes are often combined with conditional access systems so that, once the traitor tracing algorithm identifies a personal decryption key associated with the leak, the content distributor can revoke that personal decryption key, allowing honest customers to continue to watch pay television while the traitor and all the unauthorized users using the traitor's personal decryption key are cut off.) Traitor tracing schemes are used in pay television to discourage pirate decryption – to discourage legitimate subscribers from giving away decryption keys. Traitor tracing schemes are ineffective if the traitor rebroadcasts the entire (decrypted) original content. There are other kinds of schemes that discourages pirate rebroadcast – i.e., discourages legitimate subscr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Broadcast Encryption
Broadcast encryption is the cryptographic problem of delivering encrypted content (e.g. TV programs or data on DVDs) over a broadcast channel in such a way that only qualified users (e.g. subscribers who have paid their fees or DVD players conforming to a specification) can decrypt the content. The challenge arises from the requirement that the set of qualified users can change in each broadcast emission, and therefore revocation of individual users or user groups should be possible using broadcast transmissions, only, and without affecting any remaining users. As efficient revocation is the primary objective of broadcast encryption, solutions are also referred to as revocation schemes. Rather than directly encrypting the content for qualified users, broadcast encryption schemes distribute keying information that allows qualified users to reconstruct the content encryption key whereas revoked users find insufficient information to recover the key. The typical setting considered is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Challenge–response Authentication
In computer security, challenge–response authentication is a family of protocols in which one party presents a question ("challenge") and another party must provide a valid answer ("response") to be authenticated. The simplest example of a challenge–response protocol is password authentication, where the challenge is asking for the password and the valid response is the correct password. An adversary who can eavesdrop on a password authentication can then authenticate itself by reusing the intercepted password. One solution is to issue multiple passwords, each of them marked with an identifier. The verifier can then present an identifier, and the prover must respond with the correct password for that identifier. Assuming that the passwords are chosen independently, an adversary who intercepts one challenge–response message pair has no clues to help with a different challenge at a different time. For example, when other communications security methods are unavailable, th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Public-key Cryptography
Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key. Key pairs are generated with cryptographic algorithms based on mathematical problems termed one-way functions. Security of public-key cryptography depends on keeping the private key secret; the public key can be openly distributed without compromising security. In a public-key encryption system, anyone with a public key can encrypt a message, yielding a ciphertext, but only those who know the corresponding private key can decrypt the ciphertext to obtain the original message. For example, a journalist can publish the public key of an encryption key pair on a web site so that sources can send secret messages to the news organization in ciphertext. Only the journalist who knows the corresponding private key can decrypt the ciphertexts to obtain the sources' messages—an eaves ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Feige–Fiat–Shamir Identification Scheme
In cryptography, the Feige–Fiat–Shamir identification scheme is a type of parallel zero-knowledge proof developed by Uriel Feige, Amos Fiat, and Adi Shamir in 1988. Like all zero-knowledge proofs, it allows one party, the Prover, to prove to another party, the Verifier, that they possess secret information without revealing to Verifier what that secret information is. The Feige–Fiat–Shamir identification scheme, however, uses modular arithmetic and a parallel verification process that limits the number of communications between Prover and Verifier. Setup Following a common convention, call the prover Peggy and the verifier Victor. Choose two large prime integers ''p'' and ''q'' and compute the product ''n = pq''. Create secret numbers s_1, \cdots, s_k coprime to ''n''. Compute v_i \equiv s_i^ \pmod. Peggy and Victor both receive n while p and q are kept secret. Peggy is then sent the numbers s_i. These are her secret login numbers. Victor is sent the numbers v_i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uriel Feige
Uriel Feige ( he, אוריאל פייגה) is an Israeli computer scientist who was a doctoral student of Adi Shamir. Life Uriel Feige currently holds the post of Professor at the Department of Computer Science and Applied Mathematics, the Weizmann Institute of Science, Rehovot in Israel. Work He is notable for co-inventing the Feige–Fiat–Shamir identification scheme along with Amos Fiat and Adi Shamir. Honors and awards He won the Gödel Prize in 2001 "for the PCP theorem and its applications to hardness of approximation In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization problems. Scope Hardness of approximation complements the study of approximation algorithms by pro ...". References {{DEFAULTSORT:Feige, Uriel Living people Gödel Prize laureates Theoretical computer scientists Modern cryptographers Public-key cryptographers 20th-century Israeli mathematicians ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
