Privacy pass: Bypassing internet challenges anonymously

A Davidson, I Goldberg, N Sullivan… - Proceedings on …, 2018 - petsymposium.org
The growth of content delivery networks (CDNs) has engendered centralized control over
the serving of internet content. An unwanted by-product of this growth is that CDNs are fast …

Efficient zero-knowledge arguments in the discrete log setting, revisited

M Hoffmann, M Klooß, A Rupp - Proceedings of the 2019 ACM SIGSAC …, 2019 - dl.acm.org
Zero-knowledge arguments have become practical, and widely used, especially in the world
of Blockchain, for example in Zcash. This work revisits zero-knowledge proofs in the discrete …

Efficient batch zero-knowledge arguments for low degree polynomials

J Bootle, J Groth - IACR International Workshop on Public Key …, 2018 - Springer
Abstract Bootle et al.(EUROCRYPT 2016) construct an extremely efficient zero-knowledge
argument for arithmetic circuit satisfiability in the discrete logarithm setting. However, the …

Anonymous tokens with public metadata and applications to private contact tracing

T Silde, M Strand - … Conference on Financial Cryptography and Data …, 2022 - Springer
Anonymous single-use tokens have seen recent applications in private Internet browsing
and anonymous statistics collection. We develop new schemes in order to include public …

[PDF][PDF] One (Block) Size Fits All: PIR and SPIR with Variable-Length Records via Multi-Block Queries.

R Henry, Y Huang, I Goldberg - NDSS, 2013 - cypherpunks.ca
We propose a new, communication-efficient way for users to fetch multiple blocks
simultaneously in Goldberg's robust information-theoretic private information retrieval (IT …

Orca: Blocklisting in {Sender-Anonymous} Messaging

N Tyagi, J Len, I Miers, T Ristenpart - 31st USENIX Security Symposium …, 2022 - usenix.org
Sender-anonymous end-to-end encrypted messaging allows sending messages to a
recipient without revealing the sender's identity to the messaging platform. Signal recently …

Thinking inside the BLAC box: smarter protocols for faster anonymous blacklisting

R Henry, I Goldberg - Proceedings of the 12th ACM workshop on …, 2013 - dl.acm.org
We present BLACRONYM, a suite of new communication-and computation-efficient
protocols for anonymous blacklisting without trusted third parties. Our protocols improve on …

Efficient Homomorphic E-Voting Based On Batch Proof Techniques—An Improvement to Secure MPC Application

K Peng - 2022 19th Annual International Conference on Privacy …, 2022 - ieeexplore.ieee.org
E-voting is an important application of secure MPC (multi-party computation) and its
achievement of security through verifiable MPC can be based on homomorphic encryption …

Assessing cyber-incidents using machine learning

R Gore, SY Diallo, J Padilla… - International Journal of …, 2018 - inderscienceonline.com
One of the difficulties in effectively analysing and combating cyber attacks is an inability to
identify when, why and how they occur. Victim organisations do not reveal this data for fear …

Efficiently making secure two-party computation fair

H Kılınç, A Küpçü - Financial Cryptography and Data Security: 20th …, 2017 - Springer
Secure two-party computation cannot be fair against malicious adversaries, unless a trusted
third party (TTP) or a gradual-release type super-constant round protocol is employed …