Questions tagged [anonymity]
Anonymity describes the state of being unknown or unacknowledged.
31
questions with no upvoted or accepted answers
4
votes
0
answers
139
views
Anonymisation resilient to key leak
Problem statement
Elbonian citizens have been issued a card holding a random $B_j\in\{0,1\}^b$, $0\le j<2^n$, $b\ge n+20$ (representative example $b=64$, $n=28$). The habit has grown to use this ...
- 138k
3
votes
0
answers
330
views
Why is ZKP authentication not used in practice?
I have been reading about Zero Knowledge Proof (ZKP) protocols for a while now. Among the applications I have seen the most is authentication (https://ethereum.org/en/zero-knowledge-proofs/#...
3
votes
0
answers
85
views
Anonymization Standards
I'm interested in data anonymization techniques and scores for the quality of data anonymization in "the real world". I was told this is also part of cryptography.
What I know: In theory one ...
- 2,120
3
votes
0
answers
111
views
High-latency anonymous communication minimum delay?
High-latency anonymous communication (e.g. Mixmaster and Mixminion) delay messages for a long time using mixers to anonymous communications. I understand that it has applications for email and p2p but ...
- 507
3
votes
0
answers
169
views
David Chaum's anonymous credential
I am a newbie in cryptography (I know the basic RSA, AES stuffs) and am interested in anonymous authentication systems. Looks like David Chaum is the godly figure in the field. I see lots of people ...
- 131
3
votes
0
answers
104
views
During electronic voting, how does one hide the choice from Voting device?
Assume the following: I want to cast a vote during an election through an electronic voting system. For our system we make the assumption that the device one uses to cast the vote is potentially ...
- 193
2
votes
0
answers
385
views
Can you show how that RSA does/doesn't provide anonymity?
Considering a CPA-secure version of RSA where the ciphertext is just a rundom element from $Z^*_N$. Does that meet the anonymity requirement in which an cpa adversary cannot distinguish between a ...
- 2,130
2
votes
0
answers
132
views
How does Dissent protect against Sybil Attacks?
Dissent claims to be able to be resistant to Sybil attacks.
Dissent seeks to offer accountable anonymity, giving users strong guarantees of anonymity while also protecting online groups or forums ...
- 211
1
vote
0
answers
55
views
Should we classify things such as LIONESS and Tor as cryptographic primitives?
Presuming (if we ought to?) that we classify instantiations of algorithms as primitives,
https://cwe.mitre.org/data/definitions/1240.html
Colloquially, one would say that AES (and sometimes AES-256) ...
- 59
1
vote
0
answers
69
views
Security of anonymous group credential issued over multiple user secret keys plus a common/public system message
In a group signature scheme based on Pointcheval-Sanders (PS) single-message signature, the anonymous credential $(\sigma_1,\sigma_2)$ issued by the group manager (GM) with secret key $sk = (x,y) \in \...
- 11
1
vote
0
answers
33
views
Looking for a (partly) anonymous signature
I am looking a way to sign a document, so that everyone could verify that one person out of a group did, but only a special person and/or the group could know who signed it.
Let's say, X chooses a ...
- 469
1
vote
0
answers
42
views
What is the main difference between anonymous authentication and using an anonymous credential?
What is the main difference between anonymous authentication and the use of an anonymous credential? And when we should use them?
- 353
1
vote
0
answers
63
views
Cryptographic Code Anonymization
I've been reading a lot about techniques related to stylometry whereby programmers can be de-anonymized by analyzing their source code.
Resisting deanonymization seems like a multifaceted problem. ...
- 187
1
vote
0
answers
63
views
Can two anonymous parties determine whether they interacted before, without being able to link encounters?
Assume an anonymous communication system in which anonymous parties randomly meet in pairs to exchange information.
How could two anonymous parties determine whether they have interacted before, ...
- 21
1
vote
0
answers
128
views
Dining-Cryptographer Net (DC-Net) Scheme that Handles Collisions?
[Question edited at the request of Mods]
I recently became fascinated with the elegant and simple solution that Chaum proposed for the Dining Cryptographers problem. If you are unfamiliar, please ...
- 23
1
vote
0
answers
200
views
Difference between DCnet and mixnet in terms of forwarding anonymity?
It seems that with both anonymous communication protocols we can achieve some level of forwarding anonymity, however, is one protocol better than the other in this respect? It seems that they both ...
- 11
1
vote
0
answers
158
views
Why group signature based CL signature is in "sign-encrypt-prove" paradigm
In this paper, it referred that there are two paradigms used in constructing group signatures: the "sign-encrypt-prove"(SEP) paradigm and "sign-randomize-proof"(SRP) paradigm.
As said in this paper, ...
- 377
1
vote
0
answers
160
views
TPM/FIDO Direct Anonymous Attestation practicality
DAA (Direct Anonymous Attestation) is not the only scheme to achieve anonymous attestation. In general, these schemes allow an entity to stay anonymous throughout the attestation process. The concern ...
- 367
1
vote
0
answers
56
views
Proofs of security for anonymity in a multi-party setting
I'm looking for material that proves the anonymity of parties in a non-interactive setting. I would like to know if there are simulation based proofs (UC) and property based proofs (game based) for ...
- 88
1
vote
0
answers
23
views
The semantic security in Anonymous Hierarchical identity-bases encryption?
In Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) by Boyen, to prove security it defined challenge ciphertext like
I actually can't get how does the proof work? Why we ...
- 11
1
vote
0
answers
65
views
Seeking Fast Bloom Filter for Anonymous Address
I had an idea to use something like public message boards to pass secrets anonymously and non-interactively (similar to TV/Movie Trope : http://tvtropes.org/pmwiki/pmwiki.php/Main/PublicSecretMessage )...
- 437
1
vote
0
answers
59
views
identify PK in ring signatures by using (t,n)-threshold
Consider a group of $n$ public keys $pk_1,...,pk_n$ with corresponding secret keys $sk_1,...,sk_n$.
I'm looking for a cryptographic primitive with the following properties:
Ring signature property.
...
- 128
1
vote
0
answers
168
views
Revocation in Idemix and U-prove
I read some materials about MS u-prove and IBM Idemix.
But according to these materials, the opinion about revocation is different.
Some materials say that u-prove and idemix do not provide ...
- 509
1
vote
0
answers
100
views
Can a LIRA system work with cjdns or other decentralized meshnets?
LIRA (Lightweight Incentivized Routing for Anonymity) is a scheme to incentivize participants in Tor to contribute resources, in particular bandwidth.
The paper talks about it being used for Tor. Can ...
0
votes
0
answers
25
views
How to anonymously poll for information in a small group of people?
A company wants to poll employees about their view of the company (by using a web system, say). They would like to do it anonymously, but they don't want people filling out forms more than once. An ...
- 133
0
votes
0
answers
16
views
Ephemeral anonymous identities that can be slashed once forever with a single nullifier
Consider a ZKP anonymous credential scheme where each tuple of (x, identity_secret, merkle_root) corresponds to a unique nullifier computed as ...
- 1
0
votes
0
answers
22
views
How can we construct a ZKPoK which hides both $x$ and the witness $W_x$ in dynamic accumulators?
Consider a verification equation $ e(\Delta,\tilde{G}) = e(W_x,x\tilde{G}+pk_{acc})$ from a pairing based accumulator which uses the value $x$ and the corresponding witness $W_x$ to verify that a ...
0
votes
0
answers
40
views
Difficult to guess the targeted receiver
The protocol is defined as :
Bob want to send message to one of his friends say $k$ friends , he does not want his others friends (except one whom he want to send message ) to tell who is targeted ...
- 49
0
votes
0
answers
59
views
Mechanisms for masking identifying unique IDs with non-identifying unique IDs to protect privacy?
I need to suggest mechanisms for masking unique codes in a database with different unique codes that are not derived from the original unique codes, but are equivalently unique in that they could ...
0
votes
1
answer
93
views
Proving anonymous credential presentation
In a CL-based or CKS-based anonymous credential system, how can a verifier $V$ prove that a credential holder $H$ has presented it a credential that has been issued by an issuer $I$ without ...
- 125
0
votes
0
answers
60
views
Derive anonymous dsa key-pair from two certificate authorities
Is it possible to derive a dsa key-pair based on two private keys from different/independent "Certificate Authorities" (ca1 and ca2) to sign s.th. which then verifies only that the signature is a ...
- 133