instruction stringlengths 32 27.2k |
|---|
Choosing a proper nonce is a vital part of every symmetric-key encrypted communication, and it is mandatory that every encrypted message has a unique nonce. It can be shown that using a nonce twice with the same key has such catastrophic effects on the system. So in every protocol that uses AES-GCM or other AEAD algori... |
Is 7-Zip really a good encryption tool? I wonder what kind of encryption is used in 7-zip. I see most people using 7-Zip. Just curious about what extent it is safe.
|
I'm searching good libraries to manipulate lattice tools to do cryptography.
I'm mainly interested by C/C++. But I'm also interested if it is in python.
|
How Schnorr signature security can be proved for signature forgery, replacement, and Replay attacks?
|
I'm looking at the following text:
Why does CKKS decryption have an approximate correctness requiring that $\|u + e\| < {q / 2}$?
I mean if $\|u + e\| \ge {q / 2}$, how can I prove the CKKS decryption doesn't have approximate correctness?
|
In section 4.3.2 of this paper describing the BabyJubJub curve, an algorithm for computing the scalar multiple $[k]P$ is given, where $k$ is in arbitrarily large integer and $P$ is a point whose order is $251$ to $254$ bits on the BabyJubJub curve. In this algorithm, $k$ is 'split' into chunks of $248$ bits and the alg... |
ElGamal-based BBS proxy re-encryption is well known, but it works on a variant of ElGamal like ($mg^r$,$g^{xr})$ not standard ElGamal ($g^r$,$mg^{xr}$). After reading the original paper, I found the authors mentioned that the proxy scheme can be extended to work with standard EIGamal encryption. But unfortunately they ... |
A KDF in Counter Mode (e.g., see NIST SP 800-108r1, Section 4.1, similar to HKDF) produces the output as what AES-CTR would do if one replaces AES with SHA2 (or, to be exact, with HMAC).
However, NIST, Section 6.3 does not recommend using the derived keying material as a key stream.
As far as I understand, they mean th... |
The wikipedia article on the Advanced Encryption Standard claims an attack against AES-128 with complexity $2^{126.1}$. The NIST call for proposals for post-quantum cryptography (table on page 18) estimates $2^{143}$ classical gates for key-search attack against AES-128.
What does the number in the wikipedia article m... |
I am trying to get into Universal Composable Security, but before diving deeper I would like to confirm my intuition of the framework.
https://eprint.iacr.org/2000/067.pdf
A protocol $\pi$ securely evaluates a function $\mathcal{f}$ if for any adversary
$\mathcal{A}$ there exists an "ideal adversary" $\mathcal{S}$ suc... |
How do I calculate the soundness error of a sigma protocol, such as Schnorr's interactive protocol for knowledge of a discrete logarithm?
|
In this paper by Alperin-Sheriff and Peikert from 2014, the authors state
To date, bootstrapping remains the only known way of obtaining
fully homomorphic encryption for arbitrary unbounded computations.
Is this still correct today or are there new schemes that don't require bootstrapping for the same effect?
Are the... |
Purpose: I'd like to shuffle a file system's blocks without loosing space so I thought if I formatted the disk to have exactly 2^32=4bn sectors, then a secure cipher with 32 bit wide data blocks could map all sectors to new ones without wasting place, like a hash map would do due to its collision chances.
|
Blowfish encryption is made as follows:
1 - XOR the round key with half of the plaintext.
2 - Split the 32-bits word in 4 bytes and insert each one in the S-Boxes.
3 - Sum the result of byte #1 with #2 and XOR in the result of byte #3
4 - Sum the above result with result of byte #4.
5 - XOR the result of the above oper... |
I started studying again recently, I forgot plenty of stuff.
But there are 2 areas that I am really struggling.
The procedures to prove and demonstrate theorems.
The basic math necessary for cryptography.
Do you guys have any books and references that are easy to learn about those two items?
Thank you!!
|
Suppose we have two plaintexts $m_1$ and $m_2$ such a way that $|m_1| = |m_2| = 128 $ and these two plaintexts are different just in one bit. Now suppose we know the value of $c_1 = AES_{k}(m_1)$($|k| =256$) .
What is the best complexity of guessing difference $c_1 \oplus c_2 = ?$ with probability at least $\frac{1}{2... |
I have developed a project based on Raspberry Pi that communicates through Bluetooth with Android application, My idea is to enhance its privacy through encryption. So, I've tried chaotic encryption.
But I've observed a higher lattency while encrypting & Mainly I was dealing with images..It is adding up a lot of noise ... |
The AES algorithm uses the irreducible polynomial. Consider
x^8+x^4+x^3+x+1
for multiplying with a MDS matrix for encryption and decryption. Am I allowed to change this polynomial with another one? If so, then I need to redesign the MDS matrix? Does this effect security standards?
|
I'm working on a protocol and am looking for a way to fingerprint a set of elements. All elements are evenly distributed across a finite field that is integers modulus $2^{256}$.
Assume I have a set of elements $[v_0, v_1, v_2, v_3]$, and a strong random value $R$ (also in the field).
I construct a hash like this $H = ... |
Suppose we have a plaintext $m$ and $|m| = 128$. Now suppose we know $l$ bit of the output $AES_k(m) = c$.
What is the best complexity of guessing the rest $128-l$ bits of output with probability at least $\frac{1}{2}$. Note that we don't know the value of $k$
|
I'm interested on the polynomial used in GCM-mode : $X^{128}+X^7+X^2+X+1$
This polynomial is Primitive (in $\mathbb{F}_2$).
What is the interest of choosing a primitive polynomial and not a simple irreducible polynomial? Is it a coincidence?
|
How do new cache designs aid in defending against cache-based side-channel attacks?
While conducting a side-channel attack, we have the T-table/S-virtual box's address.
Normally, address mapping is handled by the operating system.
An adversary can always determine the virtual address.
How will a new cache design help?
... |
Can we encrypt data with two public keys and the encrypted data only needs one private key to decrypt once encrypted?
|
In (lattice-based) cryptography, the quotient ring $\mathbb{Z}[X]/(X^n+1)$ where $n = 2^e$ is a power of 2 is used in various cryptographic schemes (e.g., CRYSTALS-Kyber). It is my understanding that this is a common choice because we can efficiently compute products in this ring using the Number Theoretic Transform (N... |
This is an example of a bitlocker recovery key;
820042-335825-646573-481530-265253-688132-339900-822810
İs that key actually strong? It does not have any letters, it uses only numbers, so is it OK?
|
I've been implementing RSA as a learning exercise and am at a point now where I'd like to try serializing my key to a file using some standard format. I've implemented it without using the Chinese Remainder Theorem, so my private key is composed only of my modulus $n=pq$ and my modular inverse exponent $d$. I've seen t... |
Why is it that most implementations define an sha256_init, sha256_update, and sha256_final function that each operates on a SHA256_CTX object? The specification only mentions returning an almost unique hash for any given string of bits of any given length.
What is the reason to have these 3 functions instead of just a... |
I wonder if there is any practical attack on MD5(key || fixed-length-message).
|
IKEv2 RFC7296 Section 2.16, provides overview of how IKEv2 is used with EAP. That section states the following when a different identity (IDi) is used in message 2 IKE_AUTH from initiator to responder, eg anonymous@realm, and realId@realm used in EAP identity response:
When the initiator authentication uses EAP, it is... |
I am working on ssl client because of some server update I was enabling the cipher TLS_DHE_RSA_WITH_AES_128_GCM_SHA256. While handshake with server I was facing Bad Record MAC Alert message from the server.
I was verified the time stamp and encryption status that are correct. That doesn't make any problem. I have no id... |
I am using AES-GCM to encrypt some data. I want every encryption to be done with a new random iv. For every encryption a new iv is generated and appended to the encrypted text to produce the cipher. Since the iv would be send in plaintext I thought I could also generate a HMAC of the iv and the encrypted text and appen... |
Stream ciphers use a deceptively simple mechanism: you combine the plaintext data, bit by bit, with “key” bits, using the exclusive or operation.
Why can't I use other opeartions such as NAND, AND, OR . Can you guys give me one real time example which brings advantage of using XOR over other operations.
|
Fix an interactive proof system $(P,V)$ and denote by $(P_k,V_k)$ an interactive proof system in which the parties play in parallel $k$ copies of $(P,V)$ and for which $V_k$ accepts if and only if $V$ would have accepted in all $k$ copies. The Parallel Repetition Theorem says that given a prover $P$ and input $x$ to th... |
According to sources that I've read, it says that DES is not suited to a software implementation and that it is better suited to hardware, what does this mean?
|
I have a
1024-bits modulus n,
the key d which is 1022 bit long,
public exponent 65537,
two factor p and q,
and the ciphertext y 1023 bits which is all in numbers.
How can we perform decryption and work out the plaintext? I have tried CrypTool, tried entering the key d, two factor p and q, but it always give me an err... |
The secret key of BFV, BGV schemes is generated as a random ternary polynomial from R2 ( R2 is the key distribution used to sample polynomials with integer coefficients in {−1,0,1})
Is there any specific reason for it to be a ternary polynomial? can we have it as polynomial from Rq i.e integer coefficients from {0, 1, ... |
I am reading this explanation of zkSnarks written by Maksym Petkus - Why and How zk-SNARK Works
They work through the concept of zkSnarks using a polynomial which the prover knows & he has to convince the verifier that he knows it. The verifier knows that the polynomial has 2 factors ($x = 1$ & $x = 2$), he doesn't kno... |
Trying to decrypt RSA Ciphertext with a private key using OpenSSl
Used rsatool to generate a .pem file for private key which is 1022 bit long.
Converted the original cyphertext 1023 bits long from just numbers to hex values of bytes
I have used the command: openssl pkeyutl -decrypt -in C:\Users\abc\Desktop\Cypher.txt -... |
This problem is related to Fields in Cryptography, My Question is why there is no multiplicative inverse for 2, isn't it 0.5?? or matters are diffrent if it was related to galois field ? I don't quite understand.
This is the Addition Tabel...
This Is the Multiplication Tabel...
And this is the tabel with the additive... |
Modulus n = 1024 bit
p * q = 1024 bit
phi_n = (p-1)*(q-1) = 1024 bit
When calculating key d the multiplicative inverse
d = inverse_mod(e, phi_n)
The result of d is 1022 bit long instead of 1024 bit long, which is stopping me to decrypting the cyphertext of 1023 bit, the calculation is done in sagemath, where am I doing... |
Suppose someone has figured out how to factor integers in polynomial time, thus breaking the RSA system. Also suppose this person does not want to reveal the secret of how to factor integers in polynomial time, only to prove he or she has broken it (or at least give evidence that he has broken it). One way to do this w... |
The linear regression is simply $y=Wx+b$, where the server holds $W$ and $b$ and the client holds $x$. The private linear regression means the client sends encrypted $x$ to the server, and receives encrytped $y$. Then the client can decrypt $y$ for result. I have read some papers about privacy-preserving linear (logist... |
Community,
I'm new into lattice based cryptography, and I'm interested about the security of cryptography schemata like Kyber and why the focus of solving this problem lead into solving approx. SVP.
If you're looking into breaking Cryptography schemas like Kyber you find statements like:
“The best known attacks against... |
The overview of Blake3 states that Blake3 is internally a Merkle tree. Diving a bit deeper into the paper one finds out that Blake3 splits its input in chunks of 1 KiB (1024 B), organizing chunks in a binary tree whose root is used as the Blake3 hash of the input. This makes it fast to compute the Blake3 hash of large ... |
With TLS 1.3 supporting only secure, forward-secret cipher suites, are there any significant technological improvements that could still be made to the protocol?
|
I have two keypairs on the curve curve25519
k1 --> (a, aG)
k2 --> (b, bG)
I can compute and verify that a(bG) = b(aG).
Lets say k = a (bG), I'm computing scalar inverse of a which is pow(a, -1) and computing pow(a, -1) a (bG) and expecting that it will be equal to (bG) but i see its not equal to bG.
From a(bG) by only... |
The NIST Computer Security Resource Center called for nominations for a process to standardise lightweight symmetric primitives in August 2018.
In the update talk in the 2019 Lightweight Cryptography Workshop, it was hoped that winners would be announced in 2021.
At the 2020 workshop, it was hoped that finalists would ... |
Let $G:\{0, 1\}^n \to \{0, 1\}^m$ be a PRG. We define another PRG $G_0 : \{0, 1\}^n \to \{0, 1\}^m$ as follows: $G_0(s) = G(s) \oplus (0^{m−n}\mathbin\|s)$. Can there exists a secure PRG $G$ for which $G_0$ is insecure?
The question asks me to prove that such a PRG exists. But I am not sure how. Primarily I was think... |
Suppose we have two ciphertexts c1 and c2.
c1 is generated based on the param whose slots are 1024.
c2 is generated based on the param whose slots are 512.
Then is multiplication available between c1 and c2?
If not, can we shrink c1 to have 512 slots? If we can shrink, how to shrink? Any ideas, steps or references? The... |
For clarification, the protocol works as follows: $P$ wants to convince $V$ that he knows $x$ such that $g^x=y$, where $g,y\in\mathbb{G}$ of order $p$; they perform the following steps:
$P$ samples $k\stackrel{R}\leftarrow\mathbb{Z}/p\mathbb{Z}$ uniformly at random, computes commitment $r\leftarrow g^k$, and sends $r$... |
I have an encryption scheme set up with a client and server that utilizes AES 256. What I am curious about is whether or not all information sent from the server to the client can be verified as legitimate using just a single digital signature (ECDSA, secp256k1 specifically) on the key that is sent to the client.
Given... |
Given a Schnorr Public Key (32 bytes) x, I'd like to generate a compressed ECDSA Public Key (33 bytes) and thus be able to generate the bitcoin address that the private key holder can generate with their private key.
A Schnorr Public Key is x (BIP340, https://bips.xyz/340 - more detail about the Schnorr signature.)
A... |
This is an existing website with approx. 100K accounts, and passwords are hashed using bcrypt with a high number of rounds.
The current design that I'm questioning is that we're sending the username and password to the server, and doing the bcrypt on the server, instead of sending a SHA generated in the browser and bcr... |
Let we have 2 generator $G$ and $H$ in any elliptic curve.
A prover creates a ciphertext with Homomorphic ElGamal, $(r_1G,\;mG + r_1P)$ such that $r_1$ is random and $P$ is public key of the prover.
Then the prover creates a Pedersen commitment $(mG + r_2H)$ or $(mH + r_2G)$ if it makes the proof easier.
The prover wan... |
I am implementing TLS (or something like it perhaps) because the browser doesn't seem to provide a direct client-script interface to TLS. The browser provides a SubtleCrypto.encrypt() function that claims to do AES-GCM. However, the documentation for this function does not mention an input for RFC 5246/5116 AEAD Associ... |
This question pertains to identity-based key encapsulation mechanisms (IB-KEMs). To recap the functionality:
$\mathsf{KeyGen}(1^\lambda) \to (\mathsf{msk}, \mathsf{mpk})$ Generates the master keypair
$\mathsf{Extract}(\mathsf{mpk}, \mathsf{msk}, \mathsf{id}) \to \mathsf{usk}$ Constructs an identity-bound private key $... |
In the concept of Automatic Test Pattern Generation (ATPG), two events are required to perform in sequence: Fault Activation and Fault Propagation.
In the case of a linear 2-input XOR gate, without loss of generality, we consider a stuck-at-0 fault at the input register a, while the input register b may take values in... |
Situation
I need to generate unique 16-digit decimal values in NodeJS API or C++ Addon.
It's used internally in my organization (gift card id). And performance doesn't matter as it's generated non-realtime.
I've searched for some options, but unsure about their safety. If there's better way to do it, please let me know... |
My studying material states that although symmetric ciphers can be either block or stream ciphers, it also states that asymmetric can only be block ciphers without further clarification.
|
Let's say we have an IND-CPA secure public key encryption scheme $\Pi = (\text{Gen}, \text{Enc}, \text{Dec})$. Construct a new PKE $\Pi' = (\text{Gen}', \text{Enc}', \text{Dec}')$ that behaves exactly as $\Pi$ except it additionally leaks the hash of the private key. For example, $\text{Gen}' = (sk, pk \vert \vert H(sk... |
I'm reading Boneh and Shoup's book "A Graduate Course in Applied Cryptography." Im doing one of the questions at the end of the stream ciphers chapter. I'm not sure how to do this problem:
Let $\mathcal{E} = (E,D)$ be a cipher defined over $\mathcal{K}, \mathcal{M}, \mathcal{C}$. Assume that one can efficiently generat... |
I'm aware that GnuPG encrypts for multiple recipients, but is there any way to build a multisig, say, 2 of 5 signatures with GPG?
So having a file encrypted for the following recipients needs at least two of the five to decrypt it:
gpg --encrypt \
--recipient alice@example.com \
--recipient bob@example.com \
--re... |
I want to encrypt data on client side with Openssl AES 128 GCM and decrypt those data on server side inside Intel SGX using rijndael 128 GCM. I can see inside sgx_aes_gcm.cpp that it uses the same functions from Openssl.
I can imagine that the tag generated by EVP_CIPHER_CTX_ctrl(pState, EVP_CTRL_GCM_GET_TAG, 16, tag) ... |
https://en.wikipedia.org/wiki/Disk_encryption_theory
Why do we use XTS over CTR for disk encryption?
If we used ChaCha20 (without authentication) by simply encrypting each disk sector with the same random key and with the block number as the nonce (no additional data), how would this break the properties of the securit... |
We have a block cipher $E:\{0,1\}^{128}\times\{0,1\}^{128}\rightarrow\{0,1\}^{128}$.
We know that the PRP advantage of E is Adv$_E^{PRP}=t/2^{128}$ where $t$ is the time needed by the algorithm to get the maximum advantage.
From $E$ we define $E'$ such that $E':\{0,1\}^{128}\times\{0,1\}^{128}\rightarrow\{0,1\}^{128}$ ... |
In light of the LastPass hack their use of PBKDF2 had me wondering a few things.
If PBKDF2 with a salt and the Master password is used to generate a vault password every time you type in your master password to access the vault wouldn't that salt need to always be the same?
If so then where is that salt stored and wo... |
I did some experimenting with web subtle crypto.
I derived a key using PBKDF2 with SHA-512 and 100 000 iterations and timed it.
Doing same with 200 000 rounds doubled the time as expected.
Then I did PBKDF2 twice in parallel, both with same password, same iteration count (100k) but different salts. This took about same... |
I'm currently trying to write the blake3 algorithm in JS using the official whitepaper or what it's called.
If I understand correctly then... after the 7 round keyed permutation (at the end of the compression function) the first half of the output values is then xor'ed with the latter half to get the NEW first half. An... |
Is there a well know (cryptographically secure) algorithm to shuffle a vector of values, deterministically, without using any randomness, such that it is hard (or as hard as possible) to guess its initial configuration?
The goal is to achieve an effect similar to what a hash function achieves, but instead of producing ... |
Let A(x) and B(x) be two secret polynomials. Suppose a user publishes commitments $C_A$ and $C_B$ to these polynomials (such that the lengths of $C_A$ and $C_B$ are sublinear in the degree of $A(x)$ and $B(x)$). I would like to prove that the GCD of these two polynomials, (given the commitments) is 1. Is there a speci... |
I'm considering a case when after hybrid encryption (AES Key encrypted via RSA) RSA key will be "splited" like in OTP.
On the end one side gets encrypted AES key and "half" key RSA, and second side gets another "half" RSA and encrypted data what force to combine both sides to decrypt data.
But...
What in case when same... |
I was reading the FORS and DFORS Few-Time-Signature scheme. I understood the security of HORS Few time signature equals to $ (rk/t)^k $, but I could not understand the security of FORS is $ (r/t)^k $ as discussed in the following paper page no 5. [Hash based signatures Revisited]: https://eprint.iacr.org/2020/564.pdf
I... |
Using the notation from the Wikipedia article: https://en.wikipedia.org/wiki/Schnorr_signature, the Schnorr signature mixes the random value $k$ and the hash $e$ like this:
$$s = k - xe$$
(Where $x$ is the private key scalar)
My question is: What would be the problem with reversing the two scalars like this:
$$s = e -... |
I need to know if there is a security proof for ECDSA in the Random Oracle model?
|
I'm a newbie, currently interested in data security & integrity.
I'm quite new to blockchain and distributed system theories, and suffering from some unclear doubts/questions on the fault-tolerant consensus.
May I ask for your kind advice on my dull thoughts regarding on the blockchain's true objective?
It would be a g... |
Hey I got a pointer a while ago to hidden order groups and I found papers like https://eprint.iacr.org/2006/178.pdf dating way back using this, but I couldn't find any elementary read on what can and can't I do with hidden order groups.
Does anyone have a small pointer for me on where to pick up reading?
|
I am self studying "A Graduate Course in Applied Cryptography" by Boneh-Shoup. I am not sure if my proof for the following problem in the book is correct. The problem asks to prove that if a stream cipher is semantically secure, then the underlying PRG is secure. Please let me know if my attempt works. If my solution i... |
I am looking at the paper on Kate Polynomial Commitments.
The paper refers to Appendix A & Appendix B but it's not available with the document. Does anyone know where I find the full paper with the Appendices?
|
So I needed symmetric encryption for my program. I landed on AES 192 bits in the CTR mode, because of some Computerphile videos on YouTube.
After using it with the Node.js "crypto" lib implementation, I noticed that some of the outputs are very similar. The output is created from a UTF-8 SQL syntax string input and dig... |
I have access to an HSM that can sign messages but doesn't have a way to expose the private key. The signatures are deterministic (RFC 6979). Another application only works with ed25519 signatures which isn't supported by the HSM.
Is it safe to have the HSM sign a message and use the signature as a secret to determinis... |
This is a follow-up of my previous two questions (1 and 2), might be relevant to check them out first for a full context. I am trying to re-create results from this paper. The basic algorithm is described here.
I am trying to implement NTRUEncrypt system but working on a Quaternion algebra. I think the code is correct ... |
Does encrypting plaintext multiple times with the same stream cipher but independent keys increase security? If each key is n-bits, and the cascade uses m-streams, could this be considered mn-bit encryption? If so, when?
Versions of this question are already addressed in the following posts, but they seem to mostly dis... |
I understand that from security perspective the sign-then-encrypt approach is the best.
I tried to implement it in Python with the cryptography package and I got this error: ValueError: Encryption/decryption failed.
This is not surprising. The maximum I can encrypt with RSA and OAEP padding is 190 bytes, but the signat... |
I'm working on some RSA code that uses Toms Fast Math (TFM for short), and I'm trying to understand why the functions fp_exptmod (for modular exponentiation operations) and fp_invmod (for modular inverse operations) both require an odd modulus and the former also requires an odd exponent. I've written code to allow th... |
I'm working on the blinding portion of some RSA code. Some implementations I've looked at don't verify that the random number used for blinding is relative prime to N as described on the Wikipedia page for blinding:
RSA blinding involves computing the blinding operation E(x) = (xr)e
mod N, where r is a random integer... |
I'm trying to implement ECDSA for learning purposes and have generated public and private keys, which seem to be correct as I have compared them with those generated by an online tool called noble. However, my signing or verification algorithm (or both) is not working correctly and I am having difficulty debugging the ... |
Are there any known weaknesses in Barreto-Naehrig Curves (e.g. BN P256) ?
|
Cryptographic sponge functions are a hot topic right now with LWC and all.
They solve the symmetric crypto problem with simplicity and efficiency. However,
none of them seem to achieve 256-bit security without relying on a gigantic state
(such as Keyak).
For example, why isn't Gimli (as per the NIST LWC paper), which h... |
NIST P-521 has the longest key size for standardised ECC, which has 521 bits instead of 512. If a quantum computer is available, how many qubits can break P-521?
|
You can get access to this document via institutional login at https://www.researchgate.net/publication/220556089_Security_and_composition_of_cryptographic_protocols_A_tutorial
So in Ran Canettis Tutorial on Composable Security I came across some definitions of how protocols can be composed:
Earlier, it explains an e... |
Is it possible to efficiently solve the discrete log problem for $r$:
$$
g^r\equiv v\pmod N
$$
When the following constants are know:
$$
N,\ g,\ v,\ \phi=(p-1)(q-1)\text{ s.t. }N=p\,q
$$
|
As shown in this paper the IND-CPA of NTRU is based on both the decision key cracking problem and the decision ciphertext cracking problem. However, I often see claims (such as in this paper) that the OW-CPA of NTRU only relies on decision key cracking problem. I don't see a way to prove this.
Suppose that in the OW-CP... |
What if we consider an MPC protocol in which all parties are dishonest? Is it unattainable (even with allowing abort) or is it just meaningless to think about?
|
This question is a direct follow-up (hopefully - the last) of my previous one; please see it for full information. I would like to further generalise NTRU cryptosystem on higher-order algebras. Following these two papers: resource1 and resource2 I am trying to implement the method for sedonions over polynomial quotient... |
I am searching for the exact definition of High density SIS and Low density SIS, but there is something unclear about it.
SIS problem is to find $x\in \mathbb{Z}^m$ such that for random $A\in\mathbb{Z}_q^{n\times m}$, $Ax=0$ and $\lVert x\rVert < \beta$.
As far as I know, high density SIS is when $n\log q < m$, so that... |
One method to create a secure MPC protocol against malicious adversaries is to create a secure protocol against semi-honest adversaries and then add some zero-knowledge proofs to ensure that the latter protocol runs honestly.
What if we create an honest programming language in which every line of code can be proven to ... |
I'm watching "SSL, TLS, HTTPS Explained" by ByteByteGo on YouTube and at the end, starting around 5:15, there are two points that are interesting:
in TLS 1.3 RSA is no longer supported as the a method for key exchange Diffie-Hellman is a more common way nowadays for exchanging session keys Diffie-Hellman is complicate... |
How to apply local differential privacy to specific categorical values in order to perform some analysis? Does there exist a tool?
For example, I have the following dataset.
email address
0 exampleemail1 exampleadress1
1 exampleemail2 exampleadress2
From this dataset, I take as output ... |
I'm somewhat confused about how the definition of a proof of knowledge relates to the Theorem 19.1 in Boneh-Shoup (http://toc.cryptobook.us/book.pdf), particularly in relation to Schnorr's protocol for proof of knowledge of a discrete logarithm.
As far as I'm aware, the standard definition of a "proof of knowledge" is ... |
I am a beginner in cryptography.
I wonder is it possible to create by Zero Knowledge Proof, to prove Two cipherTexts that are encrypted by same Public Key with Paillier Encryption have the same value inside but without decrypting the texts. I have access to the Public Key at the moment.
I have an array which is like [1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.