Identification Protocols Secure against Reset Attacks

No abstract is available for this paper.

• Publication year

  2001

• Venue

  International Conference on the Theory and Application of Cryptographic Techniques

• Publication date

  2001-05-06

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3-540-44987-6_30
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Resettable zero-knowledge (extended abstract)

  2000cited by this paper
• Preliminary draft. Identi cation Protocols Secure Against Reset Attacks

  2000influential reference
• Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements

  2000cited by this paper
• Advances in Cryptology — CRYPTO 2000

  2000cited by this paper
• Authenticated Key Exchange Secure against Dictionary Attacks

  2000cited by this paper
• Secure Hash-and-Sign Signatures Without the Random Oracle

  1999cited by this paper
• Signature schemes based on the strong RSA assumption

  1999cited by this paper
• Resettable Zero-Knowledge

  1999cited by this paper
• A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

  1998cited by this paper
• Concurrent zero-knowledge

  1998cited by this paper
• A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract)

  1998cited by this paper
• Relations among Notions of Security for Public-Key Encryption Schemes

  1998cited by this paper
• On the Security of a Practical Identification Scheme

  1996cited by this paper
• Security of 2^t-Root Identification and Signatures

  1996cited by this paper
• New Generation of Secure and Practical RSA-Based Signatures

  1996cited by this paper
• Pseudorandom functions revisited: the cascade construction and its concrete security

  1996cited by this paper
• An Efficient Existentially Unforgeable Signature Scheme and Its Applications

  1994cited by this paper
• Entity Authentication and Key Distribution

  1993cited by this paper
• How to sign given any trapdoor permutation

  1992cited by this paper
• On Defining Proofs of Knowledge

  1992cited by this paper
• Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes

  1992cited by this paper
• Fast Signature Generation With a Fiat Shamir-Like Scheme

  1991cited by this paper
• Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

  1991cited by this paper
• Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack

  1991cited by this paper
• Non-malleable cryptography

  1991cited by this paper
• One-way functions are necessary and sufficient for secure signatures

  1990cited by this paper
• Witness indistinguishable and witness hiding protocols

  1990cited by this paper
• Public-key cryptosystems provably secure against chosen ciphertext attacks

  1990cited by this paper
• Universal one-way hash functions and their cryptographic applications

  1989cited by this paper
• The Knowledge Complexity of Interactive Proof Systems

  1989cited by this paper
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

  1988cited by this paper
• Minimum Disclosure Proofs of Knowledge

  1988cited by this paper
• A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory

  1988cited by this paper
• How to construct random functions

  1986cited by this paper
• How to Prove Yourself: Practical Solutions to Identification and Signature Problems

  1986cited by this paper
• The knowledge complexity of interactive proof-systems

  1985cited by this paper
• Relations Among Notions of Security for Public-Key Encryption Schemes

  year unknowncited by this paper

• The Quantum State Continuity Problem and Temporal Enforcement Against Fork Attacks

  2025influential citation
• Sherlock Holmes zero-knowledge protocols secure against active attackers

  2025cites this paper
• Authenticated Key Exchange Protocol with Remote Randomness

  2025cites this paper
• A Survey of Consortium Blockchain and Its Applications

  2024cites this paper
• Concurrent Security of Anonymous Credentials Light, Revisited

  2023cites this paper
• A Survey of Secure Computation Using Trusted Execution Environments

  2023cites this paper
• A Pairing-Free Identity-Based Identification Scheme with Tight Security Using Modified-Schnorr Signatures

  2021cites this paper
• Proxy Signcryption Scheme for Vehicle Infrastructure Immune to Randomness Leakage and Setup Attacks

  2020cites this paper
• An Identity Based-Identification Scheme With Tight Security Against Active and Concurrent Adversaries

  2020cites this paper
• Subversion-resilient signatures: Definitions, constructions and applications

  2020cites this paper
• Evaluating Pairing-Free Identity-Based Identification Using Curve25519

  2020cites this paper
• Cryptanalysis and improvement of medical image encryption using high-speed scrambling and pixel adaptive diffusion

  2020cites this paper
• Continuously Non-malleable Codes in the Split-State Model

  2020cites this paper
• Giving State to the Stateless: Augmenting Trustworthy Computation with Ledgers

  2019cites this paper
• On the Relation Between Security Models for HB-like Symmetric Key Authentication Protocols

  2019cites this paper
• Deniable Identification in Ephemeral Setup & Leakage Scenarios

  2019cites this paper
• Improving Signature Schemes with Tight Security Reductions

  2019cites this paper
• Pseudonymous Signature Schemes

  2018cites this paper
• On the Bit Security of Cryptographic Primitives

  2018cites this paper
• Enclave Host Ledger k Enclave Host Ledger k Enclave Host k Enclave Host k ( a ) ( b )

  2018cites this paper
• Delayed-Input and Non-Malleable Cryptographic Protocols

  2018cites this paper
• Advantages of Identity-Based Cryptosystem in E-Governance services

  2017cites this paper
• Strongly Deniable Identification Schemes Immune to Prover's and Verifier's Ephemeral Leakage

  2017cites this paper
• Code-Based Zero-Knowledge Protocols and Their Applications

  2017cites this paper
• Security of Okamoto Identification Scheme: a Defense against Ephemeral Key Leakage and Setup

  2017cites this paper
• Improved OR Composition of Sigma-Protocols

  2016cites this paper
• Schnorr-Like Identification Scheme Resistant to Malicious Subliminal Setting of Ephemeral Secret

  2016cites this paper
• Reset-Secure Identity-Based Identification Schemes Without Pairings

  2015cites this paper
• Analysis of Authenticated Key Exchange under Bad Randomness

  2015cites this paper
• Fully Leakage-Resilient Non-malleable Identification Schemes in the Bounded-Retrieval Model

  2015cites this paper
• Cryptanalysis of Two Identification Schemes

  2015cites this paper
• Generic Construction for Attribute-Based Identification Schemes Secure against Reset Attacks

  2015cites this paper
• Leakage-Resilient Signatures with Graceful Degradation

  2014cites this paper
• Proper RFID Privacy: Model and Protocols

  2014cites this paper
• Survey and new idea for attribute-based identification scheme secure against reset attacks

  2014cites this paper
• Interactive Encryption and Message Authentication

  2014cites this paper
• Efficient Statistical Zero-Knowledge Authentication Protocols for Smart Cards Secure Against Active & Concurrent Attacks

  2014cites this paper
• Efficient Statistical Zero-Knowledge Authentication Protocols for Smart Cards Secure Against Active & Concurrent Quantum Attacks

  2013cites this paper
• An Efficient Identification Scheme in Standard Model Based on the Diophantine Equation Hard Problem

  2013cites this paper
• Secure Computation Under Network and Physical Attacks

  2013cites this paper
• UC and EUC Weak Bit-Commitments Using Seal-Once Tamper-Evidence

  2013cites this paper
• Single Sign -on fMultiple Web Application or Multiple Web Application or Multiple Web Application or Multiple Web Application

  2013cites this paper
• Single Signo n for Multiple Web Application

  2013cites this paper
• Constant-round protocols of stronger security via relaxed set-up assumptions

  2013cites this paper
• Attribute-Based Identification: Definitions and Efficient Constructions

  2013influential citation
• Constant-round protocols of stronger security via relaxed set-up assumptions

  2013cites this paper
• New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications

  2012cites this paper
• A Study on Efficient Identification Schemes Secure against Concurrent Man-in-the-Middle Attacks

  2012cites this paper
• Security Architecture for Things That Think

  2012cites this paper
• Simultaneously Resettable Arguments of Knowledge

  2012influential citation
• Resettable Statistical Zero Knowledge

  2012cites this paper
• Simultaneous Resettability from Collision Resistance

  2012cites this paper
• A Framework for Secure Single Sign-On

  2011cites this paper
• A New RFID Privacy Model

  2011cites this paper
• Authenticated Key Exchange under Bad Randomness

  2011cites this paper
• A Variant of Schnorr Identity-Based Identification Scheme with Tight Reduction

  2011cites this paper
• M Web-Based System – Authentication to Single Logon to Several Applications

  2011cites this paper
• Identification Schemes from Key Encapsulation Mechanisms

  2011cites this paper
• Contribution to signature and identification schemes

  2011cites this paper
• Secure Two-Round Message Exchange

  2011cites this paper
• Computationally secure two-round authenticated message exchange

  2010cites this paper
• Jointly Executed Research Activities on Design and Analysis of Primitives and Protocols

  2010cites this paper
• Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine

  2010cites this paper
• Parallel and Concurrent Security of the HB and HB+ Protocols

  2010cites this paper
• Public-key encryption secure in the presence of randomness failures

  2010cites this paper
• Impossibility Results for RFID Privacy Notions

  2010cites this paper
• Identification Schemes of Proofs of Malleability Secure against Concurrent Man-inthe-Middle Attacks

  2010cites this paper
• Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks

  2010cites this paper
• Identity-Based Identification Scheme Secure against Concurrent-Reset Attacks without Random Oracles

  2009influential citation
• Escrowed Deniable Identification Schemes

  2009cites this paper
• RFID Authentication Protocols based on Elliptic Curves - A Top-Down Evaluation Survey

  2009cites this paper
• How to improve security and reduce hardware demands of the WIPR RFID protocol

  2009cites this paper
• An efficient identification protocol secure against concurrent-reset attacks

  2009influential citation
• Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication

  2009cites this paper
• Efficient and provably secure identification scheme without random oracles

  2009cites this paper
• Improved Security Notions and Protocols for Non-transferable Identification

  2008influential citation
• Security Proofs for Identity-Based Identification and Signature Schemes

  2008influential citation
• Parallel Key Exchange

  2008cites this paper
• Resettable and Non-Transferable Chip Authentication for E-Passports

  2008influential citation
• Authentication Mechanisms for Open Distributed Systems

  2007cites this paper
• An Efficient Identification Protocol and the Knowledge-of-Exponent Assumption

  2007cites this paper
• An efficient and secure two-flow zero-knowledge identification protocol

  2007cites this paper
• Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model

  2007cites this paper
• The power of identification schemes

  2006cites this paper
• Parallel and Concurrent Security of the HB and HB+ Protocols

  2006cites this paper
• On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order

  2006cites this paper
• A Diffie-Hellman Key Exchange Protocol Without Random Oracles

  2006cites this paper
• Software Watermarking as a Proof of Identity: A Study of Zero Knowledge Proof Based Software Watermarking

  2005cites this paper
• Constant-Round Concurrently-Secure rZK in the (Real) Bare Public-Key Model

  2005cites this paper
• Revised Fischlin's (Blind) Signature Schemes

  2005cites this paper
• Constant-Round Concurrently-Secure rZK in the (Real) Bare

  2005cites this paper
• Anonymous Identification in Ad Hoc Groups

  2004influential citation
• Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks

  2004influential citation
• Secure object identification: or: solving the Chess Grandmaster Problem

  2003influential citation
• Strengthening Zero-Knowledge Protocols Using Signatures

  2003cites this paper
• Resettable Zero-Knowledge in the Weak Public-Key Model

  2003cites this paper
• The Cramer-Shoup Strong-RSASignature Scheme Revisited

  2003cites this paper
• GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks

  2002cites this paper
• Contemporary Cryptography: The Imperatives of its Implementation

  2002cites this paper
• Towards secure IFF: preventing mafia fraud attacks

  2002cites this paper