Introduction to modern cryptography.
From MaRDI portal
pseudorandomnesspublic-key encryptionprivate-key encryptionmessage authentication codesdigital signature schemesperfectly-secret encryption
Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Authentication, digital signatures and secret sharing (94A62)
Recommendations
Cited in
(84)- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Semi-quantum money
- Leakage resilience from program obfuscation
- Pattern occurrence statistics and applications to the Ramsey theory of unavoidable patterns
- SecGDB: graph encryption for exact shortest distance queries with efficient updates
- Analysis and improvement of a novel image fusion encryption algorithm based on DNA sequence operation and hyper-chaotic system
- Jammin' on the deck
- Concurrent encrypted multimaps
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Individual cryptography
- Succinct arguments for RAM programs via projection codes
- Foundations of reconfigurable PUFs
- Private set intersection: new generic constructions and feasibility results
- Cryptology. An introduction to the science of encoding, concealing and hiding
- Modern cryptography. Volume 1. A classical introduction to informational and mathematical principle
- scientific article; zbMATH DE number 1945064 (Why is no real title available?)
- Verification of quantum computation: an overview of existing approaches
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
- Secret, verifiable auctions from elections
- SE-PSI: fog/cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter
- Publicly verifiable searchable symmetric encryption based on efficient cryptographic components
- Multi-party updatable delegated private set intersection
- Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal
- Anonymous random allocation and its applications
- An accurate, scalable and verifiable protocol for federated differentially private averaging
- Anonymous protocols: notions and equivalence
- Economically optimal variable tag length message authentication
- A statistical framework of watermarks for large language models: pivot, detection efficiency and optimal rules
- GUC-secure commitments via random oracles: new impossibility and feasibility
- A brief and understandable guide to pseudo-random number generators and specific models for security
- Fuzzy authenticated key exchange with tight security
- Format-preserving encryption: a survey
- A one-time single-bit fault leaks all previous NTRU-HRSS session keys to a chosen-ciphertext attack
- Regular lossy functions and their applications in leakage-resilient cryptography
- Injection-secure structured and searchable symmetric encryption
- Lattice-based completely non-malleable public-key encryption in the standard model
- scientific article; zbMATH DE number 7319085 (Why is no real title available?)
- 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
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- Improved signature schemes for secure multi-party computation with certified inputs
- Computing Minimum Length Representations of Sets of Words of Uniform Length
- Applications of timed-release encryption with implicit authentication
- scientific article; zbMATH DE number 5081837 (Why is no real title available?)
- Modern Cryptography and Elliptic Curves
- Provably secure Rabin-p cryptosystem in hybrid setting
- Pseudorandom functions: three decades later
- Secure and efficient outsourcing computation on large-scale linear regressions
- Reusing nonces in Schnorr signatures (and keeping it secure...)
- Blockchain-based efficient public integrity auditing for cloud storage against malicious auditors
- Fast secure two-party ECDSA signing
- Efficient leakage-resilient MACs without idealized assumptions
- Introduction to Modern Cryptography
- A lightweight identification protocol based on lattices
- Serious cryptography. A practical introduction to modern encryption. With a foreword by Matthew D. Green
- A new distribution version of Boneh-Goh-Nissim cryptosystem : Security and performance analysis
- Outsourcing computation: the minimal refereed mechanism
- A new post-quantum voting protocol based on physical laws
- Secret sharing based on quantum Fourier transform
- Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
- Computer algebra tales on Goppa codes and McEliece cryptography
- $$\text {Muckle}+$$: End-to-End Hybrid Authenticated Key Exchanges
- NTRU in Quaternion Algebras of Bounded Discriminant
- Feistel-inspired scrambling improves the quality of linear congruential generators
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- Modern cryptography primer. Theoretical foundations and practical applications
- A digital signature scheme \(\text{mCFS}^{\text{QC-LDPC}}\) based on QC-LDPC codes
- Bounded privacy-utility monotonicity indicating bounded tradeoff of differential privacy mechanisms
- 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
- Analysis of the GOST 28147-89 modes of operation that provide confidentiality
- Extending Feistel structure to DNA Cryptography
- Computing minimum length representations of sets of words of uniform length
- A comparison of cryptanalytic tradeoff algorithms
- Constant-round adaptive zero-knowledge proofs for NP
- Complexity and Cryptography
- Reconsidering generic composition: the modes A10, A11 and A12 are insecure
- Cryptography. Algorithms, protocols, and standards for computer security
- Security analysis of some diffusion mechanisms used in chaotic ciphers
- Perturbation paradigms of maintaining privacy-preserving monotonicity for differential privacy
- Two faces of blindness
- Modification tolerant signature schemes: location and correction
- Chosen ciphertext security from injective trapdoor functions
This page was built for publication: Introduction to modern cryptography.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310362)
