Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security 2015
DOI: 10.1145/2810103.2813681
|View full text |Cite
|
Sign up to set email alerts
|

Mass-surveillance without the State

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 60 publications
(14 citation statements)
references
References 18 publications
0
14
0
Order By: Relevance
“…Degabriele et al criticized [DFP15] the perfect decryptability condition required from the subverted ciphertext in BPR's model. Bellare et al improved over the attacks in [BPR14], proposing stateless attacks [BJK15] against all randomized schemes. While previous attacks [BPR14,BJK15] targeted the encryption algorithm, Armour and Poettering proposed an attack [AP19b] by subverting the decryption algorithm.…”
Section: Subversion Attacksmentioning
confidence: 99%
See 2 more Smart Citations
“…Degabriele et al criticized [DFP15] the perfect decryptability condition required from the subverted ciphertext in BPR's model. Bellare et al improved over the attacks in [BPR14], proposing stateless attacks [BJK15] against all randomized schemes. While previous attacks [BPR14,BJK15] targeted the encryption algorithm, Armour and Poettering proposed an attack [AP19b] by subverting the decryption algorithm.…”
Section: Subversion Attacksmentioning
confidence: 99%
“…Bellare et al improved over the attacks in [BPR14], proposing stateless attacks [BJK15] against all randomized schemes. While previous attacks [BPR14,BJK15] targeted the encryption algorithm, Armour and Poettering proposed an attack [AP19b] by subverting the decryption algorithm. Hodges and Stebila explored the detectability of ASAs via state resetting [HS21].…”
Section: Subversion Attacksmentioning
confidence: 99%
See 1 more Smart Citation
“…Since then kleptography has captured much interest. Bellare et al [3] introduced an idea of strong undetectability used to describe the quality of such backdoors for symmetric schemes. We modify their definition for describing kleptographic backdoors on asymmetric schemes.…”
Section: Preliminariesmentioning
confidence: 99%
“…Compared to the algorithm substitution attack on symmetric schemes by Bellare et al [3], where the strong undetectability is reduced to the security of pseudo random generators, we make the reduction to DDH assumption in the following. Now the Decision Diffie-Hellman assumption on elliptic curves states that it is hard to distinguish a sample of form (Y P, X P, XY P) from a sample of form (Y P, X P, ZP), where P is the generator of an elliptic curve, and X, Y , Z are independently uniformly random integers over Z p .…”
Section: The Quality Of Our Backdoormentioning
confidence: 99%