scientific article; zbMATH DE number 5199665

Publication date: 11 October 2007

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

digital signature schemes public-key encryption pseudorandomness private-key encryption message authentication codes perfectly-secret encryption

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)

Related Items (68)

Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ Format-preserving encryption: a survey ⋮ SE-PSI: fog/cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter ⋮ A new distribution version of Boneh-Goh-Nissim cryptosystem : Security and performance analysis ⋮ Feistel-inspired scrambling improves the quality of linear congruential generators ⋮ A brief and understandable guide to pseudo-random number generators and specific models for security ⋮ Convolutional block codes with cryptographic properties over the semi-direct product $\mathbb {Z}/N \mathbb {Z} \rtimes \mathbb {Z}/M \mathbb {Z}$ ⋮ Multi-instance publicly verifiable time-lock puzzle and its applications ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Extending Feistel structure to DNA Cryptography ⋮ A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes ⋮ Secret sharing based on quantum Fourier transform ⋮ Reusing nonces in Schnorr signatures (and keeping it secure...) ⋮ Improved signature schemes for secure multi-party computation with certified inputs ⋮ Secure and efficient outsourcing computation on large-scale linear regressions ⋮ Private set intersection: new generic constructions and feasibility results ⋮ Unnamed Item ⋮ A comparison of cryptanalytic tradeoff algorithms ⋮ Modification tolerant signature schemes: location and correction ⋮ Semi-quantum money ⋮ Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression ⋮ Computing Minimum Length Representations of Sets of Words of Uniform Length ⋮ Multi-party updatable delegated private set intersection ⋮ Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments ⋮ A lightweight identification protocol based on lattices ⋮ An accurate, scalable and verifiable protocol for federated differentially private averaging ⋮ TIDE: a novel approach to constructing timed-release encryption ⋮ The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions ⋮ Fuzzy authenticated key exchange with tight security ⋮ Two faces of blindness ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Security Analysis of Some Diffusion Mechanisms Used in Chaotic Ciphers ⋮ Jammin' on the deck ⋮ Succinct arguments for RAM programs via projection codes ⋮ Individual cryptography ⋮ Efficient leakage-resilient MACs without idealized assumptions ⋮ Anonymous random allocation and its applications ⋮ A one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attack ⋮ GUC-secure commitments via random oracles: new impossibility and feasibility ⋮ Constant-round adaptive zero-knowledge proofs for NP ⋮ Applications of timed-release encryption with implicit authentication ⋮ Lattice-based completely non-malleable public-key encryption in the standard model ⋮ Perturbation Paradigms of Maintaining Privacy-Preserving Monotonicity for Differential Privacy ⋮ Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal ⋮ Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression ⋮ Secret, verifiable auctions from elections ⋮ Publicly verifiable searchable symmetric encryption based on efficient cryptographic components ⋮ Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems ⋮ Fast secure two-party ECDSA signing ⋮ Foundations of Reconfigurable PUFs ⋮ (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes ⋮ Bounded privacy-utility monotonicity indicating bounded tradeoff of differential privacy mechanisms ⋮ Blockchain-based efficient public integrity auditing for cloud storage against malicious auditors ⋮ Pattern occurrence statistics and applications to the Ramsey theory of unavoidable patterns ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Leakage resilience from program obfuscation ⋮ Provably secure Rabin-p cryptosystem in hybrid setting ⋮ Outsourcing computation: the minimal refereed mechanism ⋮ Computer algebra tales on Goppa codes and McEliece cryptography ⋮ Unnamed Item ⋮ SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates ⋮ Economically Optimal Variable Tag Length Message Authentication ⋮ Chosen ciphertext security from injective trapdoor functions ⋮ A new post-quantum voting protocol based on physical laws ⋮ Anonymous protocols: notions and equivalence ⋮ Pseudorandom Functions: Three Decades Later ⋮ Analysis and improvement of a novel image fusion encryption algorithm based on DNA sequence operation and hyper-chaotic system ⋮ Computing minimum length representations of sets of words of uniform length

This page was built for publication: