Identity-Based Cryptosystems and Quadratic Residuosity

DOI10.1007/978-3-662-49384-7_9zbMath1388.94062OpenAlexW2292972144MaRDI QIDQ2798777

Marc Joye

Publication date: 13 April 2016

Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49384-7_9

zbMATH Keywords

public-key cryptographyidentity-based encryptionhomomorphic encryptionquadratic residuositypublic-key encryption with keyword searchanonymous encryptioncocks' scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (max. 100)

A generic construction of tightly secure signatures in the multi-user setting ⋮ Extended Galbraith's test on the anonymity of IBE schemes from higher residuosity ⋮ Topology-hiding computation on all graphs ⋮ On the distribution of quadratic residues and non-residues modulo composite integers and applications to cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of communicating systems
• Automatic verification of real-time systems with discrete probability distributions.
• A comparison of time- and reward-bounded probabilistic model checking techniques
• Syntax and semantics of the compositional interchange format for hybrid systems
• Parameter synthesis for Markov models: faster than ever
• A compositional modelling and analysis framework for stochastic hybrid systems
• A theory of stochastic systems. I: Stochastic automata
• Measurability and safety verification for stochastic hybrid systems
• CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
• Understanding Probabilistic Programs
• Explicit Model Checking of Very Large MDP Using Partitioning and Secondary Storage
• A Polymorphic Intermediate Verification Language: Design and Logical Encoding
• Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
• Input/Output Stochastic Automata
• A Simple Algorithm for Solving Qualitative Probabilistic Parity Games
• Abstraction, Refinement and Proof for Probabilistic Systems
• A Semantics for Every GSPN
• Lazy probabilistic model checking without determinisation

This page was built for publication: Identity-Based Cryptosystems and Quadratic Residuosity