Forwarded from CZAS HONORU 🇵🇱 Polski Kanał Patriotyczny Wiadomości Informacje Polityka Wojna Wydarzenia Polska Świat
This media is not supported in your browser
VIEW IN TELEGRAM
🔥Cały świat poznał kod pin Donalda Tuska
Donald Tusk, prawdopodobny przyszły premier Polski, ujawnia swój kod PIN do telefonu podczas transmisji telewizyjnej na żywo z pierwszego posiedzenia nowego parlamentu.
⭐️Subskrybuj
Forum 🏛 Bez cenzury https://t.me/forumotwarte
Kanał 🇵🇱 Info War Polska https://t.me/infowarpl
Donald Tusk, prawdopodobny przyszły premier Polski, ujawnia swój kod PIN do telefonu podczas transmisji telewizyjnej na żywo z pierwszego posiedzenia nowego parlamentu.
⭐️Subskrybuj
Forum 🏛 Bez cenzury https://t.me/forumotwarte
Kanał 🇵🇱 Info War Polska https://t.me/infowarpl
Forwarded from Michal
Ten typ tak ma 😂
https://niebezpiecznik.pl/post/haslo-premiera-donalda-tuska/
https://niebezpiecznik.pl/post/haslo-premiera-donalda-tuska/
NieBezpiecznik.pl
Hasło premiera Donalda Tuska
Kamera Szkła Kontaktowego nagrała laptopa z którego korzysta premier Donald Tusk i uchwyciła przyklejoną do niego karteczkę z loginem i hasłem. Login: rmuser43, hasło: Niebieski7.
Forwarded from r/Linux memes
Forwarded from r/Linux memes
Forwarded from r/Linux memes
Forwarded from IT step by step
This media is not supported in your browser
VIEW IN TELEGRAM
Masterpiece X - generate 3D models
A powerful neural network not only creates 3D models, but also animates them based on text messages. You simply write down the details of your character, how he should move, and quickly get a finished object.
The result can be edited and downloaded, for example, in Unreal Engine and Unity, and modified in VR. The first 250 credits for generation (enough to try it out) are free. Further - from $11 per month
A powerful neural network not only creates 3D models, but also animates them based on text messages. You simply write down the details of your character, how he should move, and quickly get a finished object.
The result can be edited and downloaded, for example, in Unreal Engine and Unity, and modified in VR. The first 250 credits for generation (enough to try it out) are free. Further - from $11 per month
Forwarded from Z P
Cryptographers Solve Decades-Old Privacy Problem - Nautilus
https://nautil.us/cryptographers-solve-decades-old-privacy-problem-444899/
https://nautil.us/cryptographers-solve-decades-old-privacy-problem-444899/
Nautilus
Cryptographers Solve Decades-Old Privacy Problem
We are one step closer to fully private internet searches.
LINUX &&|| PROGRAMMING
Cryptographers Solve Decades-Old Privacy Problem - Nautilus https://nautil.us/cryptographers-solve-decades-old-privacy-problem-444899/
#Cryptographers Solve Decades-Old Privacy Problem - #Nautilus
We all know to be careful about the details we share online, but the information we seek can also be revealing. Search for driving directions, and our location becomes far easier to guess. Check for a password in a trove of compromised data, and we risk leaking it ourselves.
These situations fuel a key question in cryptography: How can you pull information from a public database without revealing anything about what you’ve accessed? It’s the equivalent of checking out a book from the library without the librarian knowing which one.
Nautilus Members enjoy an ad-free experience. Log in or Join now .
Concocting a strategy that solves this problem—known as private information retrieval—is “a very useful building block in a number of privacy-preserving applications,” said David Wu, a cryptographer at the University of Texas, Austin. Since the 1990s, researchers have chipped away at the question, improving strategies for privately accessing databases. One major goal, still impossible with large databases, is the equivalent of a private Google search, where you can sift through a heap of data anonymously without doing any heavy computational lifting.
It would be like having a librarian scour every shelf before returning with your book.
https://nautil.us/cryptographers-solve-decades-old-privacy-problem-444899/
#privacy
We all know to be careful about the details we share online, but the information we seek can also be revealing. Search for driving directions, and our location becomes far easier to guess. Check for a password in a trove of compromised data, and we risk leaking it ourselves.
These situations fuel a key question in cryptography: How can you pull information from a public database without revealing anything about what you’ve accessed? It’s the equivalent of checking out a book from the library without the librarian knowing which one.
Nautilus Members enjoy an ad-free experience. Log in or Join now .
Concocting a strategy that solves this problem—known as private information retrieval—is “a very useful building block in a number of privacy-preserving applications,” said David Wu, a cryptographer at the University of Texas, Austin. Since the 1990s, researchers have chipped away at the question, improving strategies for privately accessing databases. One major goal, still impossible with large databases, is the equivalent of a private Google search, where you can sift through a heap of data anonymously without doing any heavy computational lifting.
It would be like having a librarian scour every shelf before returning with your book.
https://nautil.us/cryptographers-solve-decades-old-privacy-problem-444899/
#privacy
LINUX &&|| PROGRAMMING
Cryptographers Solve Decades-Old Privacy Problem - Nautilus https://nautil.us/cryptographers-solve-decades-old-privacy-problem-444899/
#Kryptograf-owie rozwiązują problem prywatności sprzed kilkudziesięciu lat — #Nautilus
Wszyscy wiemy, że należy uważać na szczegóły, które udostępniamy w Internecie, ale informacje, których szukamy, mogą również być odkrywcze. Wyszukaj wskazówki dojazdu, a nasza lokalizacja stanie się znacznie łatwiejsza do odgadnięcia. Jeśli szukasz hasła w zbiorze zainfekowanych danych, ryzykujesz, że sami je wypuścimy.
Sytuacje te rodzą kluczowe pytanie w kryptografii: w jaki sposób można wyciągnąć informacje z publicznej bazy danych, nie ujawniając niczego na temat tego, do czego uzyskano dostęp? To tak, jakby wypożyczyć książkę z biblioteki i bibliotekarz nie wiedział, którą.
Członkowie Nautilus cieszą się doświadczeniem wolnym od reklam. Zaloguj się lub Dołącz teraz.
Opracowanie strategii rozwiązującej ten problem — zwanej wyszukiwaniem prywatnych informacji — jest „bardzo przydatnym elementem wielu aplikacji chroniących prywatność” – powiedział David Wu, kryptolog z Uniwersytetu Teksasu w Austin. Od lat 90. XX wieku badacze rozwiewali tę kwestię, udoskonalając strategie prywatnego dostępu do baz danych. Jednym z głównych celów, wciąż niemożliwym do osiągnięcia w przypadku dużych baz danych, jest odpowiednik prywatnej wyszukiwarki Google, w której można anonimowo przesiewać stertę danych, bez wykonywania ciężkich obliczeń.
To jakby bibliotekarz przeszukał każdą półkę, zanim wróci z książką.
https://nautil.us/cryptographers-solve-decades-old-privacy-problem-444899/
#privacy
Wszyscy wiemy, że należy uważać na szczegóły, które udostępniamy w Internecie, ale informacje, których szukamy, mogą również być odkrywcze. Wyszukaj wskazówki dojazdu, a nasza lokalizacja stanie się znacznie łatwiejsza do odgadnięcia. Jeśli szukasz hasła w zbiorze zainfekowanych danych, ryzykujesz, że sami je wypuścimy.
Sytuacje te rodzą kluczowe pytanie w kryptografii: w jaki sposób można wyciągnąć informacje z publicznej bazy danych, nie ujawniając niczego na temat tego, do czego uzyskano dostęp? To tak, jakby wypożyczyć książkę z biblioteki i bibliotekarz nie wiedział, którą.
Członkowie Nautilus cieszą się doświadczeniem wolnym od reklam. Zaloguj się lub Dołącz teraz.
Opracowanie strategii rozwiązującej ten problem — zwanej wyszukiwaniem prywatnych informacji — jest „bardzo przydatnym elementem wielu aplikacji chroniących prywatność” – powiedział David Wu, kryptolog z Uniwersytetu Teksasu w Austin. Od lat 90. XX wieku badacze rozwiewali tę kwestię, udoskonalając strategie prywatnego dostępu do baz danych. Jednym z głównych celów, wciąż niemożliwym do osiągnięcia w przypadku dużych baz danych, jest odpowiednik prywatnej wyszukiwarki Google, w której można anonimowo przesiewać stertę danych, bez wykonywania ciężkich obliczeń.
To jakby bibliotekarz przeszukał każdą półkę, zanim wróci z książką.
https://nautil.us/cryptographers-solve-decades-old-privacy-problem-444899/
#privacy
Nautilus
Cryptographers Solve Decades-Old Privacy Problem
We are one step closer to fully private internet searches.
LINUX &&|| PROGRAMMING
Cryptographers Solve Decades-Old Privacy Problem - Nautilus https://nautil.us/cryptographers-solve-decades-old-privacy-problem-444899/
#TECHNOLOGY
Cryptographers Solve Decades-Old Privacy Problem. We are one step closer to fully private internet searches.
BY MADISON GOLDBERG November 17, 2023
We all know to be careful about the details we share online, but the information we seek can also be revealing. Search for driving directions, and our location becomes far easier to guess. Check for a password in a trove of compromised data, and we risk leaking it ourselves.
These situations fuel a key question in cryptography: How can you pull information from a public database without revealing anything about what you’ve accessed? It’s the equivalent of checking out a book from the library without the librarian knowing which one.
Nautilus Members enjoy an ad-free experience. Log in or Join now .
Concocting a strategy that solves this problem—known as private information retrieval—is “a very useful building block in a number of privacy-preserving applications,” said David Wu, a cryptographer at the University of Texas, Austin. Since the 1990s, researchers have chipped away at the question, improving strategies for privately accessing databases. One major goal, still impossible with large databases, is the equivalent of a private Google search, where you can sift through a heap of data anonymously without doing any heavy computational lifting.
It would be like having a librarian scour every shelf before returning with your book.
Nautilus Members enjoy an ad-free experience. Log in or Join now .
Now, three researchers have crafted a long-sought version of private information retrieval and extended it to build a more general privacy strategy. The work, which received a Best Paper Award in June at the annual Symposium on Theory of Computing, topples a major theoretical barrier on the way to a truly private search.
“[This is] something in cryptography that I guess we all wanted but didn’t quite believe that it exists,” said Vinod Vaikuntanathan, a cryptographer at the Massachusetts Institute of Technology who was not involved in the paper. “It is a landmark result.”
The problem of private database access took shape in the 1990s. At first, researchers assumed that the only solution was to scan the entire database during every search, which would be like having a librarian scour every shelf before returning with your book. After all, if the search skipped any section, the librarian would know that your book is not in that part of the library.
That approach works well enough at smaller scales, but as the database grows, the time required to scan it grows at least proportionally. As you read from bigger databases—and the internet is a pretty big one—the process becomes prohibitively inefficient.
Nautilus Members enjoy an ad-free experience. Log in or Join now .
In the early 2000s, researchers started to suspect they could dodge the full-scan barrier by “preprocessing” the database. Roughly, this would mean encoding the whole database as a special structure, so the server could answer a query by reading just a small portion of that structure. Careful enough preprocessing could, in theory, mean that a single server hosting information only goes through the process once, by itself, allowing all future users to grab information privately without any more effort.
For Daniel Wichs, a cryptographer at Northeastern University and a co-author of the new paper, that seemed too good to be true. Around 2011, he started trying to prove that this kind of scheme was impossible. “I was convinced that there’s no way that this could be done,” he said.
But in 2017, two groups of researchers published results that changed his mind. They built the first programs that could do this kind of private information retrieval, but they weren’t able to show that the programs were secure.
https://t.me/ProgramowanieLinux/1140
Cryptographers Solve Decades-Old Privacy Problem. We are one step closer to fully private internet searches.
BY MADISON GOLDBERG November 17, 2023
We all know to be careful about the details we share online, but the information we seek can also be revealing. Search for driving directions, and our location becomes far easier to guess. Check for a password in a trove of compromised data, and we risk leaking it ourselves.
These situations fuel a key question in cryptography: How can you pull information from a public database without revealing anything about what you’ve accessed? It’s the equivalent of checking out a book from the library without the librarian knowing which one.
Nautilus Members enjoy an ad-free experience. Log in or Join now .
Concocting a strategy that solves this problem—known as private information retrieval—is “a very useful building block in a number of privacy-preserving applications,” said David Wu, a cryptographer at the University of Texas, Austin. Since the 1990s, researchers have chipped away at the question, improving strategies for privately accessing databases. One major goal, still impossible with large databases, is the equivalent of a private Google search, where you can sift through a heap of data anonymously without doing any heavy computational lifting.
It would be like having a librarian scour every shelf before returning with your book.
Nautilus Members enjoy an ad-free experience. Log in or Join now .
Now, three researchers have crafted a long-sought version of private information retrieval and extended it to build a more general privacy strategy. The work, which received a Best Paper Award in June at the annual Symposium on Theory of Computing, topples a major theoretical barrier on the way to a truly private search.
“[This is] something in cryptography that I guess we all wanted but didn’t quite believe that it exists,” said Vinod Vaikuntanathan, a cryptographer at the Massachusetts Institute of Technology who was not involved in the paper. “It is a landmark result.”
The problem of private database access took shape in the 1990s. At first, researchers assumed that the only solution was to scan the entire database during every search, which would be like having a librarian scour every shelf before returning with your book. After all, if the search skipped any section, the librarian would know that your book is not in that part of the library.
That approach works well enough at smaller scales, but as the database grows, the time required to scan it grows at least proportionally. As you read from bigger databases—and the internet is a pretty big one—the process becomes prohibitively inefficient.
Nautilus Members enjoy an ad-free experience. Log in or Join now .
In the early 2000s, researchers started to suspect they could dodge the full-scan barrier by “preprocessing” the database. Roughly, this would mean encoding the whole database as a special structure, so the server could answer a query by reading just a small portion of that structure. Careful enough preprocessing could, in theory, mean that a single server hosting information only goes through the process once, by itself, allowing all future users to grab information privately without any more effort.
For Daniel Wichs, a cryptographer at Northeastern University and a co-author of the new paper, that seemed too good to be true. Around 2011, he started trying to prove that this kind of scheme was impossible. “I was convinced that there’s no way that this could be done,” he said.
But in 2017, two groups of researchers published results that changed his mind. They built the first programs that could do this kind of private information retrieval, but they weren’t able to show that the programs were secure.
https://t.me/ProgramowanieLinux/1140