Questions tagged [security]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
5 votes
0 answers
121 views

Quantum security of cryptosystems: Are any non-Goppa code-based systems resistant to hidden subgroup attacks?

One of the main candidates for post-quantum cryptography is code-based cryptography (as opposed to lattice-based). The Niederreiter cryptosystem based on Goppa codes is shown to be resistant to hidden ...
15 votes
2 answers
535 views

Reusing 5-independent hash functions for linear probing

In hash tables that resolve collisions by linear probing, in order to ensure $O(1)$ expected performance, it is both necessary and sufficient that the hash function be from a 5-independent family. (...
2 votes
0 answers
70 views

Looking for Research in Cryptographic Computing

I recall reading in college about a nascent research area regarding cryptographic techniques for secure computing, relating to zero-knowledge proofs, but I am having trouble remembering the exact term....
16 votes
1 answer
1k views

Password hashing using NP complete problems

Commonly used password hashing algorithms work like this today: Salt the password and feed it into a KDF. For example, using PBKDF2-HMAC-SHA1, the password hashing process is ...
15 votes
0 answers
328 views

Differential privacy and data poisoning

A differentially private algorithm takes datasets containing inputs and produces randomized outputs, such that no small change in the dataset can shift the distribution of outputs by too much. This ...
-1 votes
1 answer
59 views

semantics of "destroy object" in HRU model

In the access control model HRU there is the primitive request destroy object o which is only defined if o is an object in the current protection state which is not a subject. I am interested in why ...
23 votes
1 answer
1k views

Is the 2016 implementation of Shor's algorithm really scalable?

In the 2016 Science paper "Realization of a scalable Shor algorithm" [1], the authors factor 15 with only 5 qubits, which is fewer than the 8 qubits "required" according to Table 1 of [2] and Table 5 ...
7 votes
2 answers
999 views

Alternatives to Diffie Hellman

Assume that Discrete logarithms can be solved in linear time over any group (hence factorization is also trivial by a result of Eric Bach), is there any other candidate public key exchange problem ...
2 votes
2 answers
742 views

Help in understanding Symbolic Execution

I am an undergraduate CS student and currently reading on software security, particularly on static analysis of programs. I am particularly interested in understanding Symbolic Execution - an ...
-2 votes
1 answer
305 views

Good exploit to explore for an undergraduate research paper [closed]

I am looking to write a research paper for an undergraduate class in security. I'd like to explore the details of a security attack that's happened within the last ~15 years (within the last 5 years ...
6 votes
1 answer
657 views

The flaw in Bellare-Rogaway (1995) model on authenticated key exchange

Background: In their 1995 paper, Bellare and Rogaway describe a formal model for authenticated key exchange in a tripartite setting. In this setting, each client has a shared key with a central server,...
7 votes
1 answer
435 views

Algorithmic Complexity Attacks

I am studying algorithm construction and weaknesses to resource consumption. One vulnerability that really caught my eye was the Apache Range Header DoS Vulnerability. The following quote was taken ...
16 votes
3 answers
415 views

What is the motivation behind the definition of pseudorandom in Nisan/Wigderson?

I am reading the classic "Hardness vs Randomness" by Nisan and Wigderson. Let $B=\{0,1\}$, and fix a function $l\colon \mathbb{N} \to \mathbb{N}$. They define a family of functions $G = \{G_n : B^{l(...
9 votes
2 answers
783 views

Secure multiparty computation of number of 1s times number of 0s in a shared string

Suppose there are $N>2$ parties $p_j$, each with a bit $b_j\in{\{0,1\}}$. I want to compute the multiplication of number of ones times that of zeros, that is, $R=(\sum{b_j})\times(N-\sum{b_j})$. ...
4 votes
1 answer
186 views

Contract preservation using grammars

I am exploring using annotated grammars to formalize and enforce parts of contracts between nodes in a distributed application. I've found a number of articles on languages for specifying fairly ...
2 votes
1 answer
122 views

Formal Methods Applied to Role-Based Security (RBAC)

I wonder if someone could direct me to a basic introduction to formal methods applied to role-based security. I'm particularly interested in the question of formal verification and the kind of ...
8 votes
1 answer
378 views

Appilicability of Theoritical Computer Science in Malware research

I would like to know the importance of TCS in Malware research. Due to the large volume of new malware variants received per day (~50,000 samples/day according to McAfee), malware researchers are ...
23 votes
6 answers
803 views

Curriculum: Logical/Formal Methods in Security

At present I teach a small course (Four two hour lectures at the Masters level) on Logical Methods in Security, though the title Formal Methods in Security might be more apt. It covers briefly the ...
0 votes
3 answers
272 views

representing code path as graph walks.. a provable graph walk?

I am looking into some security analysis of arbitrary code which is represented as a graph Are there any papers on whcih graphs walks are valid code paths ? Or a provable graph walk which is shorter ...
2 votes
1 answer
195 views

Encrypting or obfuscating transport stream identifiers in SSL-like connections

First, a longish prologue. Assume typical SSL/IKE/SSH-like connections where a Diffie-Hellman exchange is done first to establish session encryption and decryption keys, where those keys are ...
1 vote
2 answers
735 views

Resources on Jablon's Protocol

Are there any good resources (descriptions, explanations, examples) regarding Jablon's protocol for password authentication using multiple servers, aside from this paper?
12 votes
1 answer
322 views

Finding the penumbra of a Constraint Satisfaction Problem

The following question has come up a number of times when testing the security of a system or model. Motivation: Software security flaws often come not from bugs due to valid inputs, but bugs ...