- nexa - server-nexa.polito.it

The new digital divide is between people who opt out of algorithms and
by J.C. DE MARTIN April 28, 2019

April 28, 2019

https://www.fastcompany.com/90336381/the-new-digital-divide-is-between-peop… (Sent from my wireless device; please excuse brevity and typos (if any))

1 0

Bolsonaro chiude facoltà pubbliche di sociologia e filosofia in Brasile
by Antonio Casilli April 27, 2019

April 27, 2019

https://www.revistaforum.com.br/bolsonaro-decreta-fim-das-faculdades-de-fil…

1 0

La competizione tecnologica che l’Europa sta perdendo – Aspenia Online
by J.C. DE MARTIN April 27, 2019

April 27, 2019

https://www.aspeniaonline.it/la-competizione-tecnologica-europa-sta-perdend… (Sent from my wireless device; please excuse brevity and typos (if any))

1 0

The Case Against Quantum Computing - IEEE Spectrum
by J.C. DE MARTIN April 27, 2019

April 27, 2019

https://spectrum.ieee.org/computing/hardware/the-case-against-quantum-compu… (Sent from my wireless device; please excuse brevity and typos (if any))

1 0

The Pentagon Wants Your Thoughts About AI but May Not Listen
by J.C. DE MARTIN April 27, 2019

April 27, 2019

https://www.wired.com/story/pentagon-wants-your-thoughts-ai-may-not-listen/ (Sent from my wireless device; please excuse brevity and typos (if any))

1 0

Statement of the FinTech Council concerning the blockchain strategy of the German government in the context of public consultations
by Giacomo April 26, 2019

April 26, 2019

https://www.bundesfinanzministerium.de/Content/EN/Downloads/2019-04-17-stat… Bitcoin is now ten years old and illustrates the potential, the successes and the problems of new blockchain technologies and DLT. It is problematic for the existing legal and economic system that this technology eludes regulatory intervention by operating on a distributed, dynamic and transnational basis. The idea of using the rules technically coded into the system as an absolute reference point instead of a legal framework appears attractive at first glance but is highly problematic. Every logical system is incomplete, as has been demonstrated using formal proofs (e.g. Gödel’s incompleteness theorem). This could also be true for DLT systems. The example of “The DAO” clearly shows that not all cases can be considered in advance and that errors exist in the system. However these systems do not provide for dealing with these cases or eliminating errors. In a way, the technical system resists a legal arrangement or correction and undermines the sovereignty of the legal system, in that users participate anonymously in a system without owner or operator. In this respect, this new technology disrupts the foundations of the existing economic and legal system. The question is whether, in the course of technological progress , the further development of operator-less blockchain technology, can create the possibilities of intervening in the technology which is necessary for the legal system, or whether the conflict between the legal system and the technical systems remains unresolved. In any case, the question arises regarding which system can prevail over the other. Morally, human sovereignty over the technical system is to be demanded; in practical terms, it remains to be seen which allegiances will form and whether humans are ready to prefer technical malfunctions to human misjudgments. At present, many societies seem to be more inclined to put their faith in technology.

1 0

Implications of Quantum Computing for Encryption Policy - Carnegie Endowment for International Peace
by Alberto Cammozzo April 26, 2019

April 26, 2019

<https://carnegieendowment.org/2019/04/25/implications-of-quantum-computing-…> [...] The security of encryption systems relies on the use of operations that can be done quickly by someone who knows a secret key but requires vastly more time for someone who does not know it. An encryption algorithm typically has an adjustable key size, and the algorithm is designed so that a modest increase in the key size causes a modest increase in decryption time for those who know the key, but a massive increase in decryption time for those who don’t know it. This ensures that the key size can be made large enough so that decryption becomes massively, prohibitively expensive for those who do not know the key, but remains very practical for keyholders. The security of a cryptographic algorithm depends on maintaining a very large gap between the effect of a key size increase on those that know the key versus those that do not know it. Decryption without knowing the key amounts, in practice, to a kind of brute-force search: it requires searching an extremely large space of possible secret keys, trying different keys in turn until finding one that unlocks the encrypted data. On a classical computer, the expected time required to do this is proportional to the number of possible keys that exist—the searcher must try half of the possible keys to have a fifty-fifty chance of trying the correct one. The effect of quantum computing on the security of an encryption algorithm depends on how large of an effect quantum computing will have on the time required for nonkeyholders to find the secret key. Encryption Algorithms That Quantum Will Thoroughly Compromise For some encryption algorithms, quantum computing might allow those without the key to sidestep entirely the need to do brute-force search by, for example, enabling a key extraction algorithm that can find the decryption key directly without a blind search. For instance, the popular Rivest-Shamir-Adleman (RSA) encryption algorithm relies on the assumption that factoring a large number is very difficult. In RSA, the secret key is essentially a pair of large prime numbers, P and Q. The product of multiplying P and Q is published, but it is assumed that an adversary who knows the product of P and Q cannot derive the factors P and Q from that product except by a variant of brute-force search. Factoring appears to be very time-consuming for classical computers, but a quantum computer could quickly extract the factors P and Q by using a method called Shor’s Algorithm. In a world with large quantum computers, RSA would not be secure because someone without the key who knows the publicly available product of P and Q could quickly recover the secret key. Encryption Algorithms That Can Be Kept Secure By Increasing Key Size Other encryption algorithms are not prone to being defeated so thoroughly by a method like Shor’s Algorithm. For these methods, quantum computing is not a fatal threat, because an adversary must still engage in brute-force search. But there is a quantum shortcut, called Grover’s Algorithm, that can speed up any brute-force search substantially, allowing a space of a given size to be searched in an amount of time proportional to the square root of that size. This approach would be enough to defeat many encryption methods if they are not adjusted. In this case, it is possible to compensate for the effect of quantum computing by increasing the key size, expanding the space that must be searched by brute force, so as to counteract the effect of Grover’s Algorithm. For many encryption algorithms, doubling the key size, say from 128 bits to 256 bits, has the effect of squaring the size of the key space that someone without the key would have to search. This countermeasure exactly offsets the square-root effect of Grover’s Algorithm, restoring the security level of the pre-quantum algorithm. One consequence is that data that was encrypted before the emergence of viable quantum computing—with the original smaller key size—will become susceptible to decryption when quantum computing does become available, but data encrypted with the larger quantum-safe key size will continue to be secure. (Like classical computers, quantum computers would be expected to get faster over time, necessitating the same kinds of generational increases in key size that have been necessary in the pre-quantum computing era.) [...]

1 0

The Tech Industry’s Psychological War on Kids – Richard Freed – Medium
by J.C. DE MARTIN April 26, 2019

April 26, 2019

https://medium.com/@richardnfreed/the-tech-industrys-psychological-war-on-k… (Sent from my wireless device; please excuse brevity and typos (if any))

1 0

Bundeskartellamt - Homepage - Bundeskartellamt prohibits Facebook from combining user data from different sources
by J.C. DE MARTIN April 26, 2019

April 26, 2019

https://www.bundeskartellamt.de/SharedDocs/Meldung/EN/Pressemitteilungen/20… (Sent from my wireless device; please excuse brevity and typos (if any))

1 0

Skip the Surveillance By Opting Out of Face Recognition At Airports
by gianluca quaglia April 26, 2019

April 26, 2019

By Jason Kelley April 24, 2019 Government agencies and airlines have ignored years of warnings from privacy groups and Senators that using face recognition technology on travelers would massively violate their privacy. Now, the passengers are in revolt as well, and they’re demanding answers. Last week, a lengthy exchange on Twitter between a traveler who was concerned about her privacy and a spokesperson for the airline JetBlue went viral, and many of the questions asked by the traveler and others were the same ones that we’ve posed to Customs and Border Protection (CBP) officials: Where did you get my data? How is it protected? Which airports will use this? Where in the airports will it be used? Most importantly, how do I opt-out? [...] continua qui https://www.eff.org/deeplinks/2019/04/skip-surveillance-opting-out-face-rec…

1 0