The Semi-Generic Group Model and Applications to Pairing-Based Cryptography

DOI10.1007/978-3-642-17373-8_31zbMath1294.94054OpenAlexW1537692422MaRDI QIDQ3058677

Andy Rupp, Tibor Jager

Publication date: 7 December 2010

Published in: Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17373-8_31

zbMATH Keywords

provable securitypairing-based cryptographycryptographic assumptionsgeneric groupsmaster theoremsRestricted models of computationsemi-generic group model

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Automated analysis of cryptographic assumptions in generic group models ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions

This page was built for publication: The Semi-Generic Group Model and Applications to Pairing-Based Cryptography