Darya Kaviani

16 followers · 9 following · 1001 views

on the atlas · 39

highlights · 67

Currently this is not built into WireGuard itself, but the open source Tailscale node software includes DERP support, which adds this feature. Over time, it’s possible the code will be refactored to include this feature in WireGuard itself. (Tailscale has already contributed several fixes and improvements to WireGuard-Go.)
How Tailscale works · Tailscale
Internet STUN and ICE standards
How Tailscale works · Tailscale
the public keys get downloaded to each node, each node configures WireGuard with a super-lightweight tunnel to each other node
How Tailscale works · Tailscale
Tailscale domains can activate instantly the moment you login
How Tailscale works · Tailscale
even if those nodes are themselves behind a firewall, in the usual way that client-server Internet protocols do
How Tailscale works · Tailscale
The hub node usually has a static IP address and a hole poked in its firewall so it’s easy for everyone to find.
How Tailscale works · Tailscale
extremely lightweight encrypted tunnels
How Tailscale works · Tailscale
The road from a theoretical breakthrough to a practical protocol can be a long one, Barak said. “But you could imagine,” he said, “that maybe 50 years from now the crypto textbooks will basically say, ‘OK, here is a very simple construction of iO, and from that we’ll now derive all of the rest of crypto.’”
Computer Scientists Achieve ‘Crown Jewel’ of Cryptography | Quanta Magazine
inference attack that achieves practically efficient, highly scalable, accurate query reconstruction against end-to-end SSE systems
Rethinking Searchable Symmetric Encryption
the encrypted search index
Rethinking Searchable Symmetric Encryption
modular computation over Zp for any integer modulus p
New Ways to Garble Arithmetic Circuits
constant-rate arithmetic garbled circuit for computation over large integers based on the Decisional Composite Residuosity
New Ways to Garble Arithmetic Circuits
Boolean circuit and applying Yao’s garbled circuit treats the inputs as bit strings instead of ring elements, and hence is not “arithmetic”.
New Ways to Garble Arithmetic Circuits
arithmetic circuit C over a ring R into a garbled circuit C' and an affine functions Li for each input bit xi, such that C' and Li(xi) reveals only the output C(x) and no other information of x
New Ways to Garble Arithmetic Circuits
1 ,n,v ) -time token is created with 2 v values
Unclonable Polymers and Their Cryptographic Applications
somewhere extractability
Batch Proofs are Statistically Hiding
constant-round interactive BARGs from one-way functions would yield constant-round SZK arguments
Batch Proofs are Statistically Hiding
existence of statistical zero-knowledge (SZK) arguments for NP
Batch Proofs are Statistically Hiding
statistically-sound batch proof for L implies that L has a Statistically Witness Indistinguishable (SWI) proof
Batch Proofs are Statistically Hiding
indistinguishability obfuscation continues to exist even if P=NP
Indistinguishability obfuscation
iO can be used to construct nearly the entire gamut of cryptographic primitives, including both mundane ones such as public-key cryptography and more exotic ones such as deniable encryption and functional encryption (which are types of cryptography that no-one previously knew how to construct[3])
Indistinguishability obfuscation
two programs that compute the same mathematical function results in programs that cannot be distinguished from each other
Indistinguishability obfuscation
hides the implementation of a program while still allowing users to run it
Indistinguishability obfuscation
Set inclusion) . Let F be a field of characteristic p > N , and suppose that ( a i ) N i =1 , ( b i ) N i =1 are arbitrary sequences of field elements. Then { a i } ⊆ { b i } as sets (with multiples of values removed), if and only if there exists a sequence ( m i ) N i =1 of field elements from F q ⊆ F such that N ∑ i =1 1 X + a i = N ∑ i =1 m i X + b i (8) in the function field F ( X ) . Moreover, we have equality of the sets { a i } = { b i } , if and only if m i 6 = 0 , for every i = 1 ,...,N .
Lookup Arguments based on Logarithmic Derivatives
quantum adversary with access to several past proofs, cannot break past zero knowledge or uncover your secret information.
How Quantum Computers affect Cryptography and Blockchain, and Solutions
hardfork to move everyones Eth to the more secure keypair set. Smart contracts do not have public keys, only addresses (recall that even a quantum computer cannot undo that hash), so funds are safu.
How Quantum Computers affect Cryptography and Blockchain, and Solutions
even if someone can derive the secret key, they will not be able to spend past UTXOs.
How Quantum Computers affect Cryptography and Blockchain, and Solutions
given a public key, they can derive the private key.
How Quantum Computers affect Cryptography and Blockchain, and Solutions
PKI certificate that can encode attributes of any type
U-Prove - Microsoft Research
state machine replication to scale to multi-core servers
All about Eve: Execute-Verify Replication for Multi-Core Servers
t − 1 of the servers can fail without compromising the object’s availability
Chain Replication for Supporting High Throughput and Availability
server’s halted state can be detected
Chain Replication for Supporting High Throughput and Availability
server halts in response to a failure
Chain Replication for Supporting High Throughput and Availability
effects of updat e operations are necessar- ily reflected in results returned by subsequent query operations
Chain Replication for Supporting High Throughput and Availability
perations to query and update indi- vidual objects are executed in some sequential order
Chain Replication for Supporting High Throughput and Availability
coordinating clusters of fail-stop storage server
Chain Replication for Supporting High Throughput and Availability
AES evaluation in 65 ms over a local-area network using a single thread
Faster Secure Two-Party Computation in the Single-Execution Setting
only ρ garbled circuits and O ( κ ) public-key operations
Faster Secure Two-Party Computation in the Single-Execution Setting
minimum 2 orders of magnitude improvement in terms of throughput per core for the reported benchmarks compared to the most recent generic GC accelerato
FASE.pdf
cloud servers to provide secure services to a large number of clients in parallel while preserving the privacy of the data from both sides
FASE.pdf
secure computation of the Triple DES and the AES block ciphers, computing the S-boxes via lookup tables
Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables
BGW protocol is secure against t corrupt parties, for 2 t <
ch3-fundamentalprotocols.pdf
[ q ( 0 )] = Õ 2 t + 1 i = 1 λ i [ q ( i
ch3-fundamentalprotocols.pdf
each party P i chooses a polynomial of degree at most t whose constant coefficient is q ( i
ch3-fundamentalprotocols.pdf
the last set (LAST) of processes to fail.
Determining the Last Process to Fail
all processes cooperatively executing a distributed task fail before the task completes
Determining the Last Process to Fail
to prove the membership of an instance x to a language L the prover first computes the first flow (the commitments) of a Σ -protocol for this statement.
Survey-SNARKs.pdf
iven a public value h , the prover authenticates himself by proving his knowledge of the secret value x associated to this public value (i.e., x is such that g x = h for a fixed generator g )
Survey-SNARKs.pdf
verify the integrity of a web page by verifying the results of queries on data stored at the server
Verena: End-to-End Integrity Protectionfor Web Applications
rotects against traffic-analysis attacks, prevents anonymous denial-of- service by malicious clients, and scales to million-user anonymity sets
Riposte: An Anonymous Messaging System Handling Millions of Users