3,865 reputation
1621
bio website
location United States
age
visits member for 3 years, 2 months
seen 30 mins ago

Sep
9
revised How can I map arbitrary group elements to unique integers without using Hash functions?
fixed title's grammar
Sep
9
comment “Practical” operations supported by functional encryption?
Note that there is a qualitative difference what homomorphic encryption does and what the other two types you mentioned do. $\:$ The results produced by homomorphic encryption are still encrypted, and one might plausibly expect the schemes to be IND-CCA1. $\:$ The results produced by the other two schemes are in-the-clear, so semantic security cannot hold. $\:$ I another type of scheme in which the private key holder can issue tokens that suffice for in-the-clear results for specific functions, although I don't remember what those papers were or whether the schemes were practical. $\;\;\;\;$
Sep
9
comment Privacy-Preserving Protocols and Proofs of Security
Where have you seen "the argument" "that, because c does not follow a perfect uniform distribution (assuming x and y do), the protocol is not secure."? $\;$
Sep
9
asked Is there a practical succinct interactive argument for fortress draws in chess endgames?
Sep
8
comment Are there valid attacks on full SHA-1?
@user220201 : $\;\;\;$ In what sense does AES provide "80 bit security"? $\:$ Is it the same as the sense in which AES also provides n bit security, for all values of n smaller than 80? $\;\;\;\;\;\;\;$
Sep
7
comment Why does FIPS 186-4 require specific sizes for keys?
verifies $\mapsto$ verifiers $\;$
Sep
6
revised Why does FIPS 186-4 require specific sizes for keys?
improved grammar
Sep
5
revised Privacy-Preserving relational databases: checking the existence of a record (or multiple records)
addressed the issue of list-queries
Sep
4
revised Privacy-Preserving relational databases: checking the existence of a record (or multiple records)
changed "lists" to "sets"
Sep
4
comment Hard problems in composite order group even when factorization is known
There is no known proof for any of them. $\;$
Sep
4
comment Hard problems in composite order group even when factorization is known
I'm pretty sure all of these remain intractable in groups whose order is a composite with a known factorization. $\;$
Sep
4
comment Hard problems in composite order group even when factorization is known
Diffie-Hellman ? $\;$
Sep
4
revised Privacy-Preserving relational databases: checking the existence of a record (or multiple records)
fixed math error
Sep
4
comment Which public key encryption scheme is re-randomizable? How can I re-randomize an encryption scheme?
eprint.iacr.org/2007/119.pdf $\;$
Sep
4
comment Privacy-Preserving relational databases: checking the existence of a record (or multiple records)
Should responses to "queries containing a list of record ids" indicate how many ids are present, or which? $\;$
Sep
4
answered Privacy-Preserving relational databases: checking the existence of a record (or multiple records)
Sep
3
comment Privacy-Preserving relational databases: checking the existence of a record (or multiple records)
The communication complexity doesn't depend on the number of elements, except perhaps for list-queries if you allow a(n exponentially) small probability of the user outputting failure without the server being able to determine on its own whether or not that will happen. $\:$ The same applies when "communication complexity" is replaced with "client's computation". $\:$ I'm going to bed, and will write up an answer tomorrow. $\;\;\;\;$
Sep
3
comment Privacy-Preserving relational databases: checking the existence of a record (or multiple records)
In that case, you can use the paper I linked to. $\;$
Sep
2
comment Privacy-Preserving relational databases: checking the existence of a record (or multiple records)
Will there be well over 1000 ids? $\;$
Sep
2
comment Privacy-Preserving relational databases: checking the existence of a record (or multiple records)
How long are the ids? $\:$ See this paper. $\;\;\;\;$