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

DOI10.1007/978-3-642-17373-8_31MaRDI QIDQ3058677zbMATH OpenOpenAlexFDO

Authors Tibor Jager, Andy Rupp

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

cryptographic assumptionsgeneric groupsmaster theoremspairing-based cryptographyprovable securityRestricted models of computationsemi-generic group model

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2156406
• Properties of certain semigroups and their potential as platforms for cryptosystems
• Using Semidirect Product of (Semi)groups in Public Key Cryptography
• Public key cryptography using semigroup actions and semirings
• Subgroup security in pairing-based cryptography
• scientific article; zbMATH DE number 3856988
• Group theoretic cryptography
• Public key cryptography based on semigroup actions
• The Exact Security of ECIES in the Generic Group Model
• Automated analysis of cryptographic assumptions in generic group models

Cited in

(17)

• The algebraic group model and its applications
• Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
• Automated analysis of cryptographic assumptions in generic group models
• Succinct functional commitment for a large class of arithmetic circuits
• Using Semidirect Product of (Semi)groups in Public Key Cryptography
• The Uber-Assumption Family
• The Exact Security of ECIES in the Generic Group Model
• scientific article; zbMATH DE number 7312512 (Why is no real title available?)
• On the Equivalence of Generic Group Models
• Generic-Group Identity-Based Encryption: A Tight Impossibility Result
• Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
• Algebraic group model with oblivious sampling
• Polymath: Groth16 is not the limit
• Constraint-friendly map-to-elliptic-curve-group relations and their applications
• On knowledge-soundness of Plonk in ROM from falsifiable assumptions
• The brave new world of global generic groups and UC-secure zero-overhead SNARKs
• The structured generic-group model

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058677)