Theory of Cryptography

DOI10.1007/b106171zbMath1079.94548OpenAlexW4251449056WikidataQ59379672 ScholiaQ59379672MaRDI QIDQ5711667

Jens Groth

Publication date: 7 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b106171

zbMATH Keywords

digital signaturehomomorphic encryptionRSA modulusinteger commitment

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Efficient cryptosystems from \(2^k\)-th power residue symbols, A verifiable secret shuffle of homomorphic encryptions, Partial Key Exposure Attack on CRT-RSA, Programmable hash functions and their applications, Lossy Identification Schemes from Decisional RSA, Perfect Non-interactive Zero Knowledge for NP, On the amortized complexity of zero-knowledge protocols, Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli, An Efficient On-Line/Off-Line Signature Scheme without Random Oracles