scientific article

zbMath1323.94001MaRDI QIDQ3191615

Yehuda Lindell, Jonathan N. Katz

Publication date: 6 October 2014

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

zbMATH Keywords

stream ciphersblock ciphersdigital signature schemeselliptic curve cryptographypublic-key encryptionpseudorandomnessprivate-key encryptionhash functionsmessage authentication codesrandom-oracle modelperfectly-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 (31)

LESPP: lightweight and efficient strong privacy preserving authentication scheme for secure VANET communication ⋮ Verifiable Range Query Processing for Cloud Computing ⋮ Tightness subtleties for multi-user PKE notions ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ On the gold standard for security of universal steganography ⋮ Random oracles and non-uniformity ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Private computation of polynomials over networks ⋮ Isolated elliptic curves and the MOV attack ⋮ On the leakage-resilient key exchange ⋮ Integrity Preserving Multi-keyword Searchable Encryption for Cloud Computing ⋮ On the complexity of the herding attack and some related attacks on hash functions ⋮ Categorical composable cryptography: extended version ⋮ An asymmetric dynamic multiparty quantum secret sharing against active attacks ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based ⋮ Reconstructing Generalized Staircase Polygons with Uniform Step Length ⋮ A geometric protocol for cryptography with cards ⋮ Möbius transforms, coincident Boolean functions and non-coincidence property of Boolean functions ⋮ Undeniable signature scheme based over group ring ⋮ Searchable symmetric encryption over multiple servers ⋮ Access Control Encryption for Equality, Comparison, and More ⋮ Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? ⋮ An improved parallel block Lanczos algorithm over GF(2) for integer factorization ⋮ Memory Erasability Amplification ⋮ How to Prove Knowledge of Small Secrets ⋮ Multiparty generation of an RSA modulus ⋮ Distinguishing attack on the NTRUCipher encryption scheme ⋮ Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited ⋮ Cryptography and algorithmic randomness

This page was built for publication: