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

Chanathip Namprempre

dblp:77/4059 · DBLP profile ↗
← Back
16ranked-venue papers
2as first author
0since 2021 · last 2014
—ORCID · none

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

Security and privacy · 14 · 2 first-authorTheory of computation · 2

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
13 papers
Cryptographic primitives and cryptanalysis · 83% Cryptographic protocols and secure computation · 10% Authentication and access control · 7%

Topics — the 16 heaviest of 18, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
authenticated encryption
0.352014
Reconsidering Generic Composition · EUROCRYPT 2014
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm · J. Cryptol. 2008
Authenticated encryption in SSH: provably fixing the SSH binary packet protocol · CCS 2002
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures
0.352009
Security Proofs for Identity-Based Identification and Signature Schemes · J. Cryptol. 2009
From Identification to Signatures Via the Fiat-Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security · IEEE Trans. Inf. Theory 2008
Unrestricted Aggregate Signatures · ICALP 2007
Cryptographic primitives and cryptanalysis › authenticated encryption
generic composition
0.332014
Reconsidering Generic Composition · EUROCRYPT 2014
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm · J. Cryptol. 2008
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm · ASIACRYPT 2000
Cryptographic primitives and cryptanalysis › symmetric cryptography
online ciphers
0.222012
On-line Ciphers and the Hash-CBC Constructions · J. Cryptol. 2012
Online Ciphers and the Hash-CBC Construction · CRYPTO 2001
Authentication and access control › authentication › authentication protocols
identification schemes
0.232009
Security Proofs for Identity-Based Identification and Signature Schemes · J. Cryptol. 2009
From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security · EUROCRYPT 2002
From Identification to Signatures Via the Fiat-Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security · IEEE Trans. Inf. Theory 2008
Cryptographic primitives and cryptanalysis
symmetric cryptography
0.112012
On-line Ciphers and the Hash-CBC Constructions · J. Cryptol. 2012
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
identity-based signature
0.122009
Security Proofs for Identity-Based Identification and Signature Schemes · J. Cryptol. 2009
Security Proofs for Identity-Based Identification and Signature Schemes · EUROCRYPT 2004
Cryptographic protocols and secure computation
fiat-shamir transform
0.122008
From Identification to Signatures Via the Fiat-Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security · IEEE Trans. Inf. Theory 2008
From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security · EUROCRYPT 2002
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › multiparty signatures
aggregate signatures
0.112007
Unrestricted Aggregate Signatures · ICALP 2007
Cryptographic primitives and cryptanalysis
hash functions
0.122012
On-line Ciphers and the Hash-CBC Constructions · J. Cryptol. 2012
Online Ciphers and the Hash-CBC Construction · CRYPTO 2001
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
blind signatures
0.012003
The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme · J. Cryptol. 2003
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
chosen-ciphertext security
0.012002
Authenticated encryption in SSH: provably fixing the SSH binary packet protocol · CCS 2002
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
forward-secure signature
0.012002
From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security · EUROCRYPT 2002
Cryptographic protocols and secure computation
secure channel
0.012002
Secure Channels Based on Authenticated Encryption Schemes: A Simple Characterization · ASIACRYPT 2002
Cryptographic primitives and cryptanalysis
encryption
0.012001
Online Ciphers and the Hash-CBC Construction · CRYPTO 2001
Cryptographic primitives and cryptanalysis › provable security
security notions
0.012000
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm · ASIACRYPT 2000

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

security proof · 0.1security notion relations · 0.1random oracle model · 0.1forward security · 0.1fiat-shamir transform · 0.0
YearPublicationVenuePosition
2014 Reconsidering Generic Composition
Chanathip Namprempre, Phillip Rogaway, Thomas Shrimpton
EUROCRYPT1
2012 On-line Ciphers and the Hash-CBC Constructions
Mihir Bellare, Alexandra Boldyreva, Lars R. Knudsen, Chanathip Namprempre
J. Cryptol.4
2009 Security Proofs for Identity-Based Identification and Signature Schemes
Mihir Bellare, Chanathip Namprempre, Gregory Neven
J. Cryptol.2
2008 Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Mihir Bellare, Chanathip Namprempre
J. Cryptol.2
2008 From Identification to Signatures Via the Fiat-Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security
abstract
The Fiat-Shamir paradigm for transforming identification schemes into signature schemes has been popular since its introduction because it yields efficient signature schemes, and has been receiving renewed interest of late as the main tool in deriving forward-secure signature schemes. In this paper, minimal (meaning necessary and sufficient) conditions on the identification scheme to ensure security of the signature scheme in the random oracle model are determined, both in the usual and in the forward-secure cases. Specifically, it is shown that the signature scheme is secure (respectively, forward-secure) against chosen-message attacks in the random oracle modelifandonlyifthe underlying identification scheme is secure (respectively, forward-secure) against impersonation underpassive(i.e., eavesdropping only) attacks, and has its commitments drawn at random from a large space. An extension is proven incorporating a random seed into the Fiat-Shamir transform so that the commitment space assumption may be removed.
Michel Abdalla, Jee Hea An, Mihir Bellare, Chanathip Namprempre
IEEE Trans. Inf. Theory4
2007 Unrestricted Aggregate Signatures
Mihir Bellare, Chanathip Namprempre, Gregory Neven
ICALP2
2006 On the (Im)possibility of Blind Message Authentication Codes
Michel Abdalla, Chanathip Namprempre, Gregory Neven
CT-RSA2
2004 Security Proofs for Identity-Based Identification and Signature Schemes
Mihir Bellare, Chanathip Namprempre, Gregory Neven
EUROCRYPT2
2004 Breaking and provably repairing the SSH authenticated encryption scheme: A case study of the Encode-then-Encrypt-and-MAC paradigm
abstract
The secure shell (SSH) protocol is one of the most popular cryptographic protocols on the Internet. Unfortunately, the current SSH authenticated encryption mechanism is insecure. In this paper, we propose several fixes to the SSH protocol and, using techniques from modern cryptography, we prove that our modified versions of SSH meet strong new chosen-ciphertext privacy and integrity requirements. Furthermore, our proposed fixes will require relatively little modification to the SSH protocol and to SSH implementations. We believe that our new notions of privacy and integrity for encryption schemes with stateful decryption algorithms will be of independent interest.
Mihir Bellare, Tadayoshi Kohno, Chanathip Namprempre
ACM Trans. Inf. Syst. Secur.3
2003 The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme
Mihir Bellare, Chanathip Namprempre, David Pointcheval, Michael Semanko
J. Cryptol.2
2002 Secure Channels Based on Authenticated Encryption Schemes: A Simple Characterization
Chanathip Namprempre
ASIACRYPT1
2002 Authenticated encryption in SSH: provably fixing the SSH binary packet protocol
abstract
The Secure Shell (SSH) protocol is one of the most popular cryptographic protocols on the Internet. Unfortunately, the current SSH authenticated encryption mechanism is insecure. In this paper we propose several fixes to the SSH protocol and, using techniques from modern cryptography, we prove that our modified versions of SSH meet strong new chosen-ciphertext privacy and integrity requirements. Furthermore, our proposed fixes will require relatively little modification to the SSH protocol or to SSH implementations. We believe that our new notions of privacy and integrity for encryption schemes with stateful decryption algorithms will be of independent interest.
Mihir Bellare, Tadayoshi Kohno, Chanathip Namprempre
CCS3
2002 From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security
Michel Abdalla, Jee Hea An, Mihir Bellare, Chanathip Namprempre
EUROCRYPT4
2001 Online Ciphers and the Hash-CBC Construction
Mihir Bellare, Alexandra Boldyreva, Lars R. Knudsen, Chanathip Namprempre
CRYPTO4
2001 Forward-Secure Threshold Signature Schemes
Michel Abdalla, Sara Miner More, Chanathip Namprempre
CT-RSA3
2000 Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Mihir Bellare, Chanathip Namprempre
ASIACRYPT2