Decaf: Eliminating Cofactors Through Point Compression

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Annual International Cryptology Conference

• Publication date

  2015-08-16

• Fields of study

  Chemistry, Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-662-47989-6_34
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Selecting elliptic curves for cryptography: an efficiency and security analysis

  2016cited by this paper
• Cryptanalysis of the dragonfly key exchange protocol

  2014cited by this paper
• Fast and compact elliptic-curve cryptography

  2012cited by this paper
• High-speed high-security signatures

  2011influential reference
• On isogeny classes of Edwards curves over finite fields

  2011influential reference
• Cryptographic Hardware and Embedded Systems - CHES 2011

  2011cited by this paper
• An efficient protocol for authenticated key agreement

  2011cited by this paper
• Efficient Indifferentiable Hashing into Ordinary Elliptic Curves

  2010cited by this paper
• J-PAKE: Authenticated Key Exchange without PKI

  2010cited by this paper
• Efficient Arithmetic on Hessian Curves

  2010cited by this paper
• Faster Group Operations on Elliptic Curves

  2009cited by this paper
• Jacobi Quartic Curves Revisited

  2009cited by this paper
• Circular-Secure Encryption from Decision Diffie-Hellman

  2008cited by this paper
• Twisted Edwards Curves

  2008influential reference
• Twisted Edwards Curves Revisited

  2008cited by this paper
• Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems

  2007cited by this paper
• Faster Addition and Doubling on Elliptic Curves

  2007cited by this paper
• A normal form for elliptic curves

  2007cited by this paper
• On the Importance of Public-Key Validation in the MQV and HMQV Key Agreement Protocols

  2006cited by this paper
• Curve25519: New Diffie-Hellman Speed Records

  2006cited by this paper
• HMQV: A High-Performance Secure Diffie-Hellman Protocol

  2005cited by this paper
• Simple Password-Based Encrypted Key Exchange Protocols

  2005influential reference
• An Efficient Protocol for Authenticated Key Agreement

  2003cited by this paper
• The Jacobi Model of an Elliptic Curve and Side-Channel Analysis

  2003cited by this paper
• Preventing SPA/DPA in ECC Systems Using the Jacobi Form

  2001cited by this paper
• Short Signatures from the Weil Pairing

  2001cited by this paper
• Strong password-only authenticated key exchange

  1996influential reference
• Speeding the Pollard and elliptic curve methods of factorization

  1987cited by this paper

• ECCFROG522PP: An Enhanced 522-bit Weierstrass Elliptic Curve

  2025cites this paper
• ZK-SERIES: Privacy-Preserving Authentication using Temporal Biometric Data

  2025cites this paper
• On cofactored verification of EdDSA signatures

  2025influential citation
• Revisiting Keyed-Verification Anonymous Credentials

  2025cites this paper
• Improvements to Lucas-sequence modular square roots and primality testing

  2025cites this paper
• Embedded Curves and Embedded Families for SNARK-Friendly Curves

  2024cites this paper
• Optimization of Ristretto255 Group Implementation for Cortex-M4 based Cryptographic Applications

  2024cites this paper
• A Prime-Order Group with Complete Formulas from Even-Order Elliptic Curves

  2024cites this paper
• Armed with Faster Crypto: Optimizing Elliptic Curve Cryptography for ARM Processors

  2024cites this paper
• Bulletproofs With Stochastic Equation Sets

  2023cites this paper
• Provably Unforgeable Threshold EdDSA with an Offline Participant and Trustless Setup

  2023cites this paper
• Remote Attestation with Constrained Disclosure

  2023cites this paper
• PubHubs identity management

  2023cites this paper
• Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS

  2023cites this paper
• Speranza: Usable, Privacy-friendly Software Signing

  2023influential citation
• EC-ECC: Accelerating Elliptic Curve Cryptography for Edge Computing on Embedded GPU TX2

  2022influential citation
• The most efficient indifferentiable hashing to elliptic curves of j-invariant 1728

  2022cites this paper
• Point-Halving and Subgroup Membership in Twisted Edwards Curves

  2022cites this paper
• Double-Odd Jacobi Quartic

  2022influential citation
• Fast Multi-party Private Set Operations in the Star Topology from Secure ANDs and ORs

  2022cites this paper
• An Introduction to Formal Verification for Elliptic Curve Cryptography via Coq

  2022influential citation
• A survey of elliptic curves for proof systems

  2022cites this paper
• Subgroup membership testing on elliptic curves via the Tate pairing

  2022influential citation
• EcGFp5: a Specialized Elliptic Curve

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

  2021cites this paper
• Security Analysis of CPace

  2021cites this paper
• Proposal: Σ -protocols

  2021cites this paper
• DIT: De-Identified Authenticated Telemetry at Scale

  2021cites this paper
• Brakedown: Linear-time and post-quantum SNARKs for R1CS

  2021cites this paper
• A note on group membership tests for $\G_1$, $\G_2$ and $\G_T$ on BLS pairing-friendly curves

  2021cites this paper
• Compare Before You Buy: Privacy-Preserving Selection of Threat Intelligence Providers

  2021cites this paper
• Double-Odd Elliptic Curves

  2020cites this paper
• Quarks: Quadruple-efficient transparent zkSNARKs

  2020cites this paper
• Speeding up regular elliptic curve scalar multiplication without precomputation

  2020cites this paper
• A Provably-Unforgeable Threshold EdDSA with an Offline Recovery Party

  2020cites this paper
• Overview of Polkadot and its Design Considerations

  2020cites this paper
• Metal: A Metadata-Hiding File-Sharing System

  2020cites this paper
• Spartan: Efficient and general-purpose zkSNARKs without trusted setup

  2020cites this paper
• Towards Threshold Key Exchange Protocols

  2020cites this paper
• The complete cost of cofactor h=1

  2019cites this paper
• Byzantine Fault Tolerant Vector Consensus with Anonymous Proposals

  2019cites this paper
• Prime, Order Please! Revisiting Small Subgroup and Invalid Curve Attacks on Protocols using Diffie-Hellman

  2019cites this paper
• Anonymity Preserving Byzantine Vector Consensus

  2019cites this paper
• Polymorphic Encryption and Pseudonymisation of IP Network Flows

  2019cites this paper
• Efficiencies in Binary Elliptic Curves

  2018cites this paper
• Differential Addition on Twisted Edwards Curves

  2017cites this paper
• H YPHAE : Social Secret Sharing

  2017cites this paper
• Speeding up Elliptic Curve Scalar Multiplication without Precomputation

  2017cites this paper
• On Indifferentiable Hashing into the Jacobian of Hyperelliptic Curves of Genus 2

  2017cites this paper
• On Indefferentiable hashing into the Jacobian of a particular class of (Hyper)elliptic Curves of Genus 1 and 2 .

  2017cites this paper
• Complete Addition Formulas for Prime Order Elliptic Curves

  2016cites this paper
• Sécurisation matérielle pour la cryptographie à base de courbes elliptiques

  2016cites this paper
• A New Sign-Change Attack on the Montgomery Ladders

  2016cites this paper
• Ed448-Goldilocks, a new elliptic curve

  2015cites this paper