All Questions
Tagged with protocol-analysis encryption
24 questions
0
votes
0
answers
45
views
Order of Enigma's rotors does not increase total number of keys
I have a question about “order of rotors”. I read about Enigma but I do not understand this point. If the machine has 3 rotors, for example 1_2_3, so it has 26×26×26 total keys. If we change the ...
3
votes
1
answer
1k
views
How does SMB authentication work?
When I learned about the inner workings of the TLS protocol and what exactly it protects a connection against, I was surprised to learn that even asymmetric encryption can be defeated by a MITM attack ...
2
votes
1
answer
262
views
Confirming understanding of security protocol modelled in Scyther
In university, I'm currently learning how to use Scyther to model security protocols. Currently I am trying to understand what is happening in an example protocol given to me which is:
...
14
votes
1
answer
3k
views
What is universal composability guaranteeing, specifically? Where does it apply, and where does it not?
I don't have a proper computer science education, so bear with my misunderstandings.
UC is supposed to "guarantee strong security properties". From what I stand, if you have some secure ...
3
votes
1
answer
541
views
Does using Noise asynchronously weaken its security properties?
Can Noise be used asynchronously without weakening its security properties?
Specifically, there are two users, A and B, who communicate asynchronously by leaving messages for each other on an ...
-1
votes
1
answer
88
views
Which encryption mode is best for transport of random values?
I was wondering which block encryption mode or modes will be most appropriate for transport of random values of one-block length. Block length could be of size 256 bytes and transport is from person ...
2
votes
1
answer
73
views
Are the following asymmetric encryption schemes equivalent?
Consider the scenario where you want a machine to be able to send daily encrypted backups to a storage server.
You'd prefer to not use simply a symmetric key for encryption, because if the machine ...
0
votes
1
answer
99
views
Is function Deterministic or Probabilistic in the malicious security definition?
As you see, according to the attached definitions from "Efficient Secure Two-Party Protocols", the definition of the security in the semi-honest world has two cases for $f=(f_1,f_2)$.(deterministic ...
0
votes
1
answer
493
views
Basic encrypted custom protocol
I've been suggested to ask here instead of stackoverflow, so here I am.
I'd like to encrypt the data of my application that uses a custom protocol I've created. I know about TLS and other protocols ...
59
votes
2
answers
12k
views
Is the software that uses PGP broken, or is it PGP itself?
PGP is all over the news (even on TV) and there seems to be a lot of confusion about it.
For the time being, people face articles like Attention PGP users: new vulnerabilities require you to take ...
16
votes
0
answers
2k
views
Has Telegram security been significantly improved with MTProto 2.0?
Telegram messenger's original encryption scheme, MTProto 1.0, has been shunned by most cryptographers for a number of reasons, like being vulnerable to IND-CCA attack; being unorthodox in general, ...
1
vote
0
answers
1k
views
Is the crypto riot.im claims to use safe? [closed]
My friends want to communicate with me using “about.riot.im”, I tried to research them and the protocols they claim to use and I only found their own websites promoting it, so the whole thing seems ...
-5
votes
1
answer
116
views
Is a symmetric cryptographic code secure if only the sender and recipient know the method used to encrypt? [closed]
I recently designed an encoding method that I'm fairly sure is unique. Is it universally secure, provided that anyone intercepting the message doesn't know anything about how it was encrypted? Could ...
7
votes
0
answers
363
views
Security proof in (Ciphertext-Policy) Attribute-Based Encryption
I am having hard time understanding the security proof in Attribute-Based Encryption, especially in Ciphertext-Policy Attribute-Based Encryption.
To do reduction in CP-ABE scheme, how do I check that ...
6
votes
1
answer
2k
views
Security of Fernet Construction (wrt non self delimiting tokens and HMAC short key size)
Fernet is a described as a "high level symmetric encryption recipe" (source) that seems to be the default high level encryption scheme in the cryptography python ...
0
votes
0
answers
142
views
Permuted Hash Table
Suppose we have a hash table, $HT$, consisting of $100$ bins.The hash table uses a hash function $H$ that is public.
We all know that given value $a$ we can compute the address in the hash by $H(a)=j$...
0
votes
0
answers
59
views
When we use permutation and random long sting to hide a message
This question is modified version of this:
Can we use merely permutation to hide a message?
I have an English name $m=m_1 || m_2 ||..||m_{30}$.
I pick a random string $d=d_1 ||..||d_{70}$
I mix ...
1
vote
0
answers
40
views
Security issues with self encryption? [duplicate]
I'm thinking about the scenario of using a set of (potentially untrusted) hosts to store (potentially private) files. Think something like distributed backup where you contribute some disk space and ...
8
votes
5
answers
3k
views
Does frequent key change weaken encryption?
Following scenario:
We are using OTR for communication between Alice and Bob which means after each successfull message exchange a re-keying happens for both parties leading to new AES-keys for the ...
0
votes
1
answer
679
views
Comparing messages given only the ciphertext
Under RSA protocol I was wondering how a message sent could be verified
under the following scenario
Alice has a private (encryption key) and public key (decryption key)
If Bob sends Alice cipher-...
3
votes
2
answers
106
views
Re-sending captured encrypted data
Let’s assume Bob is some algorithmic stock trading machine. Bob takes commands from Alice, who sends messages to Bob.
For example: Alice could be sending a message to Bob to stop trading. But if ...
2
votes
1
answer
149
views
To prove $r \cdot f_1 +f_2 \cdot (s+1)$ is secure
We define the polynomials $r, f_1,f_2,s \in R[x]$. Where $r$ is a random degree 1 polynomial and $s$ is a random polynomial such that: $degree(s)=degree(f_1)=degree(f_2)$, let $R$ be $\mathbb{Z}_p$ ...
4
votes
2
answers
877
views
Spoofing protocol nonce
Amy and Betty have a shared key $k$, and the protocol below is to provide a mutual authentication for both Betty and Amy.
A sends B : $n_a$
B sends A : $n_b \;\|\; E(k, n_a)$
A sends B : $E(k, n_b)$
...
7
votes
1
answer
647
views
Can two people with different one time pads securely exchange a message like this?
Alice has a message, generates a one time pad, encrypts her message and sends it to Bob. Bob generates his own one time pad, encrypts the message again, and sends it back to Alice. Alice then decrypts ...