Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Patrick Towa

dblp:254/8685 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
4since 2021 · last 2024
0000-0003-1771-6331ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 7 · 1 first-author · 3 since 2021Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
3 papers
Cryptographic protocols and secure computation · 62% Cryptographic primitives and cryptanalysis · 38%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
1.222024
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments · J. Cryptol. 2024
Succinct Diophantine-Satisfiability Arguments · ASIACRYPT (3) 2020
Cryptographic primitives and cryptanalysis
public-key cryptography
0.412020
Public-Key Generation with Verifiable Randomness · ASIACRYPT (1) 2020
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
succinct arguments
0.412020
Succinct Diophantine-Satisfiability Arguments · ASIACRYPT (3) 2020
Cryptographic primitives and cryptanalysis › cryptographic foundations
cryptographic commitments
0.212024
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments · J. Cryptol. 2024
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic commitments
homomorphic commitments
0.212024
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments · J. Cryptol. 2024

Methods — techniques the papers use, named apart from their topics

succinct arguments · 0.4
YearPublicationVenuePosition
2024 Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments
Tohru Kohrita, Patrick Towa
J. Cryptol.2
2023 Attribute-based Single Sign-On: Secure, Private, and Efficient
abstract
A Single Sign-On (SSO) system allows users to access different remote services while authenticating only once. SSO can greatly improve the usability and security of online activities by dispensing with the need to securely remember or store tens or hundreds of authentication secrets. On the downside, today's SSO providers can track users' online behavior, and collect personal data that service providers want to see asserted before letting a user access their resources. In this work, we propose a new policy-based Single Sign-On service, i.e., a system that produces access tokens that are conditioned on the user's attributes fulfilling a specified policy. Our solution is based on multi-party computation and threshold cryptography, and generates access tokens of standardized format. The central idea is to distribute the role of the SSO provider among several entities, in order to shield user attributes and access patterns from each individual entity. We provide a formal security model and analysis in the Universal Composability framework, against proactive adversaries. Our implementation and benchmarking show the practicality of our system for many real-world use cases.
Tore Kasper Frederiksen, Julia Hesse, Bertram Poettering, Patrick Towa
Proc. Priv. Enhancing Technol.4
2022 KEMTLS with Delayed Forward Identity Protection in (Almost) a Single Round Trip
Felix Günther 0001, Simon Rastikian, Patrick Towa, Thom Wiggers
ACNS3
2021 Hardware security without secure hardware: How to decrypt with a password and a server
Olivier Blazy, Laura Brouilhet, Céline Chevalier, Patrick Towa, Ida Tucker, Damien Vergnaud
Theor. Comput. Sci.4
2020 Public-Key Generation with Verifiable Randomness
Olivier Blazy, Patrick Towa, Damien Vergnaud
ASIACRYPT (1)2
2020 Succinct Diophantine-Satisfiability Arguments
Patrick Towa, Damien Vergnaud
ASIACRYPT (3)1
2020 Zone Encryption with Anonymous Authentication for V2V Communication
abstract
Vehicle-to-vehicle (V2V) communication systems are currently being prepared for real-world deployment, but they face strong opposition over privacy concerns. Position beacon messages are the main culprit, being broadcast in cleartext and pseudonymously signed up to 10 times per second. So far, no practical solutions have been proposed to encrypt or anonymously authenticate V2V messages. We propose two cryptographic innovations that enhance the privacy of V2V communication. As a core contribution, we introduce zone-encryption schemes, where vehicles generate and authentically distribute encryption keys associated to static geographic zones close to their location. Zone encryption provides security against eavesdropping, and, combined with a suitable anonymous authentication scheme, ensures that messages can only be sent by genuine vehicles, while adding only 224 Bytes of cryptographic overhead to each message. Our second contribution is an authentication mechanism fine-tuned to the needs of V2V which allows vehicles to authentically distribute keys, and is called dynamic group signatures with attributes. Our instantiation features unlimited locally generated pseudonyms, negligible credential download-and-storage costs, identity recovery by a trusted authority, and compact signatures of 216 Bytes at a 128-bit security level.
Jan Camenisch, Manu Drijvers, Anja Lehmann, Gregory Neven, Patrick Towa
EuroS&P5
2019 Efficient Fully Secure Leakage-Deterring Encryption
Jan Camenisch, Maria Dubovitskaya, Patrick Towa
IMACC3