scientific article; zbMATH DE number 1942427

Publication date: 30 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2442/24420288.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

cryptanalysis generalized birthday problem blind signature schemes

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Combinatorial probability (60C05) Authentication, digital signatures and secret sharing (94A62)

Related Items

On the hardness of the Lee syndrome decoding problem ⋮ S-semantics -- an example ⋮ Solving the learning parity with noise problem using quantum algorithms ⋮ Finding low-weight polynomial multiples using the rho method ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ SR-MuSig2: a scalable and reconfigurable multi-signature scheme and its applications ⋮ Analysis of (U,U+V)-code problem with Gramian over binary and ternary fields ⋮ Non-interactive Mimblewimble transactions, revisited ⋮ A non-heuristic approach to time-space tradeoffs and optimizations for BKW ⋮ \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Lifting standard model reductions to common setup assumptions ⋮ Universally composable $\varSigma $-protocols in the global random-oracle model ⋮ Information set decoding for Lee-metric codes using restricted balls ⋮ Statistical decoding 2.0: reducing decoding to LPN ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ On elliptic curve $L$-functions integrated encryption scheme ⋮ Two-round trip Schnorr multi-signatures via delinearized witnesses ⋮ MuSig2: simple two-round Schnorr multi-signatures ⋮ Walsh transforms and cryptographic applications in bias computing ⋮ Improvements to RSA key generation and CRT on embedded devices ⋮ Boomerang Distinguishers on MD4-Family: First Practical Results on Full 5-Pass HAVAL ⋮ Improved Analysis of ECHO-256 ⋮ Boomerang Attacks on Hash Function Using Auxiliary Differentials ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Streebog compression function as PRF in secret-key settings ⋮ FROST: Flexible round-optimized Schnorr threshold signatures ⋮ Quantum algorithms for the $k$-XOR problem ⋮ A survey on fast correlation attacks ⋮ Boomerang Attack on Step-Reduced SHA-512 ⋮ A discrete logarithm-based approach to compute low-weight multiples of binary polynomials ⋮ One-more unforgeability of blind ECDSA ⋮ A new approach for finding low-weight polynomial multiples ⋮ A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes ⋮ Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ Information-set decoding with hints ⋮ A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme ⋮ On the security of ECDSA with additive key derivation and presignatures ⋮ Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2 ⋮ McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD ⋮ Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes ⋮ Syndrome Decoding Estimator ⋮ Characterizing collision and second-preimage resistance in Linicrypt ⋮ A pseudorandom number generator based on worst-case lattice problems ⋮ Asymptotically efficient lattice-based digital signatures ⋮ Improved algorithms for finding low-weight polynomial multiples in $\mathbb F_2[x$ and some cryptographic applications] ⋮ On the (im)possibility of secure ElGamal blind signatures ⋮ On the hardness of module learning with errors with short distributions ⋮ Attacks on a double length blockcipher-based hash proposal ⋮ Generic attacks on hash combiners ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ Context discovery and commitment attacks. How to break CCM, EAX, SIV, and more ⋮ New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ A new diversity estimator ⋮ Asymptotic results for the number of Wagner's solutions to a generalised birthday problem ⋮ The extended $k$-tree algorithm ⋮ Fast computation of linear approximation over certain composition functions and applications to SNOW 2.0 and SNOW 3G ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba ⋮ Improved combinatorial algorithms for the inhomogeneous short integer solution problem ⋮ A method of evaluating the security of Snow 2.0-like ciphers against correlation attacks over the finite extensions of two element field ⋮ Syndrome Based Collision Resistant Hashing ⋮ Towards factoring in $\mathrm{SL}(2,\mathbb F_{2^n})$ ⋮ Integral distinguishers for reduced-round Stribog ⋮ Known-Key Distinguishers for Some Block Ciphers ⋮ An Improved Multi-set Algorithm for the Dense Subset Sum Problem ⋮ A generalized birthday approach for efficiently finding linear relations in $\ell$-sequences ⋮ Robust and timely communication over highly dynamic sensor networks ⋮ Орбитальные производные над кольцом вычетов. Часть I. Общие свойства ⋮ Espresso: a stream cipher for 5G wireless communication systems ⋮ Really Fast Syndrome-Based Hashing ⋮ Fast Correlation Attacks: Methods and Countermeasures ⋮ Analysis of Reduced-SHAvite-3-256 v2 ⋮ GENERALIZED BIRTHDAY PROBLEMS IN THE LARGE-DEVIATIONS REGIME ⋮ An algorithmic framework for the generalized birthday problem ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Improved Algorithms for the Approximate k-List Problem in Euclidean Norm ⋮ Enhancing the security of perfect blind DL-signatures ⋮ Unnamed Item ⋮ Improved Zero-Knowledge Identification with Lattices ⋮ Interpreting Hash Function Security Proofs ⋮ Slidex attacks on the Even-Mansour encryption scheme ⋮ Cryptanalysis of the GOST Hash Function ⋮ One-Round ID-Based Blind Signature Scheme without ROS Assumption ⋮ Safe-Errors on SPA Protected Implementations with the Atomicity Technique ⋮ Некоторые методы анализа функций хэширования и их применение к алгоритму ГОСТ Р 34.11-94 ⋮ Linearization Attacks Against Syndrome Based Hashes ⋮ Better Key Sizes (and Attacks) for LWE-Based Encryption ⋮ Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes ⋮ Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks ⋮ On the (in)security of ROS ⋮ Two-round $n$-out-of-$n$ and multi-signatures and trapdoor commitment from lattices ⋮ Two-round $n$-out-of-$n$ and multi-signatures and trapdoor commitment from lattices ⋮ Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security ⋮ On the (in)security of ROS ⋮ Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256 ⋮ Parallel-CFS ⋮ Subspace Distinguisher for 5/8 Rounds of the ECHO-256 Hash Function ⋮ Cryptanalysis of Luffa v2 Components ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications ⋮ Compactness of hashing modes and efficiency beyond Merkle tree ⋮ Cryptanalysis of an E0-like combiner with memory ⋮ Cryptanalysis of Tweaked Versions of SMASH and Reparation ⋮ Decoding One Out of Many ⋮ An overview of distinguishing attacks on stream ciphers ⋮ Simple Schnorr multi-signatures with applications to bitcoin ⋮ Quantum Hardness of Learning Shallow Classical Circuits ⋮ Revisiting Gilbert's known-key distinguisher ⋮ Results on multiples of primitive polynomials and their products over GF(2) ⋮ Lattice-based blind signatures, revisited ⋮ Constructing Carmichael numbers through improved subset-product algorithms ⋮ Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric ⋮ Attacks on beyond-birthday-bound MACs in the quantum setting ⋮ Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model ⋮ Optimal merging in quantum $k$-xor and $k$-sum algorithms