We construct an Identity-Based Key Encapsulation Mechanism (IBKEM) in a generic “leveled” multilinear map setting and prove its security under multilinear decisional Diffie-Hellmanin assumption in the selective-ID model. Then, we make our IB-KEM translated to the GGH framework, which defined an “approximate” version of a multilinear group family from ideal lattices, and modify our proof of secu...

In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Such contracts do not allow agents to eeciently accommodate future events. Game theory has proposed contingency contracts to solve this problem. Among computational agents, contingency contracts are often impractical due to large numbers of interdependent and unanticipated future ev...

In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Such contracts do not allow agents to eeciently accommodate future events. Game theory has proposed contingency contracts to solve this problem. Among computational agents, contingency contracts are often impractical due to large numbers of interdependent and unanticipated future ev...

In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts | i.e. contracts where each party can decommit by paying a predetermined penalty|were recently shown to improve expected social welfare even if agents decommit insincerely in Nash equilibrium. Such contracts diier based on whether agents have to declare ...