scholarly journals Aggregate and Verifiably Encrypted Signatures from Multilinear Maps without Random Oracles

2009 ◽  
pp. 750-759 ◽  
Author(s):  
Markus Rückert ◽  
Dominique Schröder
Keyword(s):  
Random Oracles ◽  
Multilinear Maps

A CCA2-Secure Multi-Decrypter Encryption Scheme Without Random Oracles

Informatica ◽  
2015 ◽  
Vol 26 (3) ◽  
pp. 543-556
Author(s):  
Shengbao Wang ◽  
Peng Zeng ◽  
Kim-Kwang Raymond Choo ◽  
Hongbing Wang
Keyword(s):  
Encryption Scheme ◽  
Random Oracles

Sender Authenticated Key Agreements without Random Oracles

2009 ◽  
Vol E92-A (8) ◽  
pp. 1787-1794
Author(s):  
Chifumi SATO ◽  
Takeshi OKAMOTO ◽  
Eiji OKAMOTO
Keyword(s):  
Random Oracles

New short group signature scheme without random oracles

2011 ◽  
Vol 31 (3) ◽  
pp. 790-792
Author(s):  
Yan YUAN ◽  
Guang-xing CAI
Keyword(s):  
Group Signature ◽  
Signature Scheme ◽  
Random Oracles

Fully anonymous multi-service subscription system without random oracles

2013 ◽  
Vol 33 (2) ◽  
pp. 417-422
Author(s):  
Xin LIU ◽  
Wenqing LEI
Keyword(s):  
Random Oracles

scholarly journals A Novel Construction of Constrained Verifiable Random Functions

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
Muhua Liu ◽  
Ping Zhang ◽  
Qingtao Wu
Keyword(s):  
Random Function ◽  
Secret Key ◽  
Bilinear Maps ◽  
Random Functions ◽  
Compute Function ◽  
Multilinear Maps ◽  
Verifiable Random Functions ◽  
Selective Security

Constrained verifiable random functions (VRFs) were introduced by Fuchsbauer. In a constrained VRF, one can drive a constrained key skS from the master secret key sk, where S is a subset of the domain. Using the constrained key skS, one can compute function values at points which are not in the set S. The security of constrained VRFs requires that the VRFs’ output should be indistinguishable from a random value in the range. They showed how to construct constrained VRFs for the bit-fixing class and the circuit constrained class based on multilinear maps. Their construction can only achieve selective security where an attacker must declare which point he will attack at the beginning of experiment. In this work, we propose a novel construction for constrained verifiable random function from bilinear maps and prove that it satisfies a new security definition which is stronger than the selective security. We call it semiadaptive security where the attacker is allowed to make the evaluation queries before it outputs the challenge point. It can immediately get that if a scheme satisfied semiadaptive security, and it must satisfy selective security.

scholarly journals A note on extensions of multilinear maps defined on multilinear varieties

2021 ◽  
pp. 1-26
Author(s):  
W. T. Gowers ◽  
L. Milićević
Keyword(s):  
Finite Fields ◽  
Vector Spaces ◽  
Restriction Map ◽  
Zero Set ◽  
Dimensional Vector ◽  
Prime Field ◽  
Finite Dimensional ◽  
Multilinear Maps ◽  
Multilinear Map

Abstract Let $G_1, \ldots , G_k$ be finite-dimensional vector spaces over a prime field $\mathbb {F}_p$ . A multilinear variety of codimension at most $d$ is a subset of $G_1 \times \cdots \times G_k$ defined as the zero set of $d$ forms, each of which is multilinear on some subset of the coordinates. A map $\phi$ defined on a multilinear variety $B$ is multilinear if for each coordinate $c$ and all choices of $x_i \in G_i$ , $i\not =c$ , the restriction map $y \mapsto \phi (x_1, \ldots , x_{c-1}, y, x_{c+1}, \ldots , x_k)$ is linear where defined. In this note, we show that a multilinear map defined on a multilinear variety of codimension at most $d$ coincides on a multilinear variety of codimension $O_{k}(d^{O_{k}(1)})$ with a multilinear map defined on the whole of $G_1\times \cdots \times G_k$ . Additionally, in the case of general finite fields, we deduce similar (but slightly weaker) results.

scholarly journals THE POLYNOMIAL NUMERICAL INDEX OF A BANACH SPACE

2006 ◽  
Vol 49 (1) ◽  
pp. 39-52 ◽  
Author(s):  
Yun Sung Choi ◽  
Domingo Garcia ◽  
Sung Guen Kim ◽  
Manuel Maestre
Keyword(s):  
Banach Space ◽  
Positive Integer ◽  
Banach Spaces ◽  
Compact Space ◽  
Linear Operators ◽  
Homogeneous Polynomials ◽  
Numerical Radius ◽  
Disc Algebra ◽  
Multilinear Maps ◽  
Numerical Index

AbstractIn this paper, we introduce the polynomial numerical index of order $k$ of a Banach space, generalizing to $k$-homogeneous polynomials the ‘classical’ numerical index defined by Lumer in the 1970s for linear operators. We also prove some results. Let $k$ be a positive integer. We then have the following:(i) $n^{(k)}(C(K))=1$ for every scattered compact space $K$.(ii) The inequality $n^{(k)}(E)\geq k^{k/(1-k)}$ for every complex Banach space $E$ and the constant $k^{k/(1-k)}$ is sharp.(iii) The inequalities$$ n^{(k)}(E)\leq n^{(k-1)}(E)\leq\frac{k^{(k+(1/(k-1)))}}{(k-1)^{k-1}}n^{(k)}(E) $$for every Banach space $E$.(iv) The relation between the polynomial numerical index of $c_0$, $l_1$, $l_{\infty}$ sums of Banach spaces and the infimum of the polynomial numerical indices of them.(v) The relation between the polynomial numerical index of the space $C(K,E)$ and the polynomial numerical index of $E$.(vi) The inequality $n^{(k)}(E^{**})\leq n^{(k)}(E)$ for every Banach space $E$.Finally, some results about the numerical radius of multilinear maps and homogeneous polynomials on $C(K)$ and the disc algebra are given.

Graph-Induced Multilinear Maps from Lattices

2015 ◽  
pp. 498-527 ◽  
Author(s):  
Craig Gentry ◽  
Sergey Gorbunov ◽  
Shai Halevi
Keyword(s):  
Multilinear Maps
Sign in / Sign up

Export Citation Format

Share Document