So, hi, my name is Damiano, and now I'm going to present a giant project with Peter Scholl, titled Multi-Party Multiplication Triples for Speeds from Ringelpian. So the main contribution of our work is the design of an actively secure MPC protocol for the generation of authenticated beaver triples. And the novelty is that this construction achieves sub-linear communication in the amount of generated material. So I will start by explaining what Speeds is. So Speeds is an efficient multi-party computation protocol for computations over a large prime field F. And it achieves active security by relying on the online phase, offline phase paradigm. Specifically, we have this input independent preprocessing phase called offline phase, where the parties generate large amount of correlated material. And later on in the online phase, the parties use this correlated randomness to compute the output of their function in a secure way. So without revealing any information about the inputs. Thanks to this paradigm, the complexity of the online phase is really low. So the main type of correlated material that we generate in the offline phase is called beaver triple or multiplication triples. And as the name suggests, these are needed to compute multiplications. Specifically, we need one multiplication triple per multiplication gate. And so we need a lot of them. And usually the generation of these is rather expensive. So which is exactly a beaver triple. As I said at the beginning, we are working over a large prime field F. And suppose that N is the number of parties. So beaver triple is a random tuple of secret shared elements as the one that you see on the screen. So we have X and Y that are uniformly random over the field. And then we have a secret sharing of their product. Here the square brackets denote additive secret sharing among then parties. So beaver triple is the union of these three terms. And actually it allows us only to achieve passive security. And speeds wants active security. So the construction introduces a Mac key alpha that is uniformly distributed over the field and secret shared among them parties. Alpha is used to authenticate all the beaver triples. And this is done by introducing some Macs that are also secret shared among them parties. So we have X times alpha, the Mac over X, Y times alpha, the Mac over Y, and X times Y times alpha, the Mac over the product. And yet the union of the beaver triple with its Macs is called an authenticated beaver triple. Okay, now I'm going to talk about the main tool that allowed us to achieve low communication complexity in our triple generation protocol. And this is called the pseudo random correlation generator or PCG for short. So PCG is a particular construction that allows us to generate large amounts of correlated material with no communication. And this is done by expanding small correlated seeds. So specifically a PCG is an unparty construction. So let me draw in parties. And we tackle some correlation function C. So let's denote the outputs by R1, RN. So these are correlated values. And there is one for each party. In particular, RI is addressed to party PI. So the PCG specifies how to generate N small seeds, K1, KN. And their generation is performed by a trusted dealer. So after the seeds have been distributed, all the parties can locally expand them. So without any interaction, obtaining large amounts of correlated material. So I will write that party PI obtains the vector RI. So P2 obtains the vector R2, P1 obtains the vector R1. And with this notation, I mean that these N vectors are all correlated entry by entry, according to C. Specifically, its entry of the vector RI has the same form as the i-th output of the correlation functions. So now I would like to talk a little bit about security of PCGs. And in order to do so, assume that the subset of parties is corrupt. So clearly the corrupted parties know their outputs. And these outputs leak some information about the outputs of the honest parties. That's because the samples that we obtained by expanding the PCG seeds are all correlated. So there is nothing we can do to avoid this leakage. It's something intrinsic in the problem. However, I noticed that there is another potential issue, namely that the corrupted parties also see their seeds. And these seeds may leak some additional information. And we don't want that. So the security definition of PCGs states exactly this. The seeds of the corrupted parties leak no information about the outputs of the honest parties, except what can be inferred from their expansion R2 and RI. So at the beginning, it may seem strange that we base our triple generation protocol on this PCG constructions that need a trusted dealer for the generation of the seeds. Indeed, the whole point of a triple generation protocol is to get rid of trusted dealers in speeds. However, notice that the PCG seeds are all small. So usually it is not hard to design multi-party computation protocols that generate and distribute them with linear communication in the seed size. So when we compose these protocols with the expansion phase, and this composition is trivially secure because the expansion is not interactive, we obtain protocols that generate large amounts of correlated randomness with sublinear communication in the size of the outputs. And this is exactly what we want. So recently, there has been some work on PCGs for bigger triples. And the first work is by Boyle Tull at Crypto 2019, where they designed a PCG that generates an unauthenticated bigger triples for end parties with logarithmic seed size in the number of triples that are generated. One year later, the same authors designed another PCG, but now for authenticated bigger triples. And the seed size is still logarithmic in it. However, this construction works only in the two-party setting. But what about authenticated bigger triple in the end party setting? Well, until recently, no efficient construction was known. But in this work, we present a solution with O of square root of M seed size. So the security of our PCG relies on the Ringel PN assumption, which I'm going to describe now. So our setting is a ring R, which is the quotient between the polynomial ring over the field F, and the ideal generated by a polynomial F of X. We also introduced two parameters. The first one is a small constant C. And then we have T that is roughly the size of the security parameter lambda. We also introduce a distribution, which is denoted by HWT. And these samples are random T-spars polynomial over the ring R. And with T-spars, I mean that this polynomial has at most 10 of zero coefficients. Now, consider the following pair. We have A that is uniformly distributed over R to the C. So C is this small parameter here. And then we have the inner product between A and another vector E. And E is sampled according to HWT to the C. Specifically, that means that E is a C-dimensional vector. And each entry of E is a T-spars polynomial in the ring R. So the ring LPN assumption states that this pair is computationally indistinguishable from A U, where A is again uniform over R to the C, whereas U is uniform over R. So essentially, the ring LPN assumption states that even if A is known, the inner product looks random over the ring R. So the second tool that we used for the construction of our PCG is called distributed point function, or DPF for short. So DPF is a particular tool that allows us to compress an n-party secret sharing of a unit vector into n small keys. So a unit vector is a particular vector where all the entries are zero except for one. On this slide, I denoted the non-zero element by a red square. And its position is called the special position of the unit vector. And we denoted by omega. So a DPF takes as input a unit vector and outputs n small keys, one for each party. And the size of the keys is sublinear in the size of the unit vector that is given as input. Moreover, even if the part is collude, the keys leak no information about the special position, omega, and the non-zero element, the red square. And finally, the compression has also the nice property that is invertible. So the parties can take their keys and expand them locally. So without an interaction, obtaining a n-party secret sharing of the unit vector that was given as input for the key generation. So what is the state of the art of distributed point functions? In the two-party setting, they are really efficient. Indeed, we know constructions that have logarithmic key size in the length of the unit vector that we give as input. However, in the three-party setting, the constructions are not as efficient. Indeed, the best solution have O of square root of n a key size. Finally, in the n-party setting, they get even worse because, yes, the key size is still O of square root of n, but there is also a factor that is exponential in the number of parties. So we can finally talk about our PCG for multi-party beaver triple. Our goal is to take a Mackey alpha uniform over the field and n-authenticated beaver triples and compress them into some small material. So the first thing that we do is to choose the ring R where we instantiate the ring LPN assumption. And in particular, we choose R to be isomorphic to F to the n, where F to the n is a ring with entry-wise addition and multiplication. It is possible to make this choice because the polynomial F of X here does not need to be reducible for security. It can also split into linear factors. Now, take the Mackey and the n-authenticated beaver triples using the isomorphism here. And without any interaction, the parties are able to convert them into one single authenticated beaver triple over the ring R. And what I mean is that now X and Y are uniform at random over the ring R, whereas alpha remains the same as before, so a field element. The nice thing of the isomorphism is also that it is invertible. So the parties are able to convert material of this kind into n-authenticated beaver triples over the field F. And this is done without any interaction. So we notice that all of a sudden our goal has become to compress a single authenticated beaver triple over the ring R. And we are going to do this by compressing each term one after another. So we start from X and Y. And as I said before, these are uniformly random elements over the ring R that are secret shared among the n-parties. So suppose that the random oracle now provides everybody with a random vector A belonging to R to the C. Each party PI will compress each shares of X and Y as follows. So first of all, it samples two vectors of sparse polynomials, UI and VI, using the distribution HWT to the C. They wanted to introduce with the ring LPN assumption. So next PI sets each share of X to be XI, the inner product between A and UI. And similarly, it sets each share of Y to be the inner product between A and VI. So you understand it by the ring LPN assumption XI and YI now look random, even if A is public. But the entropy of XI and YI now is low because they are described in terms of sparse polynomials. And the description of sparse polynomials is short. So next we compress the terms alpha 10 X and alpha 10 Y. And we start by observing that alpha 10 X can be rewritten as the sum over I and J of alpha I times XJ, where alpha I and XJ represent the shares of PI and PJ respectively. These can again be rewritten as the sum over I and J of alpha I times the inner product between A and UJ, which is also equal to the sum over I and J of the inner product between A and alpha I times UJ. Okay, now suppose that the parties have a secret sharing of alpha I times UJ between the parties PI and PJ only. So I use these indexes I and J at the brackets to denote two parties secret sharing between PI and PJ only. So if the parties have these n square secret sharing, they are able to obtain a secret sharing of alpha 10 X between the n parties due to the linearity of the inner product and the sum here. Moreover, these n square secret sharing leak no information about the shares of PI and PJ to the other parties. Indeed, in order to leak some information, both PI and PJ would need to be corrupt. And in this case, what we leak is actually alpha I and UJ, which are values that are already known to this. So now our goal will be to compress these terms instead of these. So what's the structure of UJ? UJ is a C dimensional vector over the ring R and each entry is a T sparse polynomial of degree n. So here we represent these polynomials by listing the coefficients starting from the term of degree zero. And then on zero coefficients are represented with colored squares. So when we multiply UJ by alpha I, the structure remains the same. That's because alpha I is an element of the field. So the only thing that changes is the color of the squares. So the value of the coefficient changes, but their positions remain the same as before. So how can we compress a secret sharing of alpha I times UJ between party PI and PJ only? Well, we notice that each entry of this vector can be written as the sum of T and dimensional unit vectors. For instance, these would be those associated with the first entry. And now we know how to compress secret sharing of unit vectors using DPS. In particular, when we perform the operation, we provide the parties with keys that leak no information about alpha I and UJ to the parties because of the security of DPS. And the material that we obtain in this way is small. In particular, it is just C times T pairs of DPS keys. C because there are C entries and T because there are T unit vectors per entry. And the size of these keys is logarithmic in N because it is just a secret sharing between two parties. So next, we compress the terms X times Y. So we do it similar to X times alpha. Indeed, we notice that X times Y can be rewritten as the sum over I and J of XI times YJ, where XI and YJ are the shares of PI and PJ respectively. And this can again be rewritten as the sum over I and J of the inner product between A and UI with the inner product between A and VJ. This last term can be proven to be equal to the sum over I and J of the inner product between the outer product of A with itself and then the outer product between UI and VJ. I will define this outer product later in the next slide. So now suppose that the parties have a two-party secret sharing of UI outer product with VJ between party PI and PJ only. So due to the linearity of the inner product and of the sum here, the parties can convert these N square two-party secret shareings into a single secret sharing of X times Y between all the N parties without any interaction. Now our goal will be to compress these two-party secret shareings between PI and PJ. So basically we are doing the same thing that we did for alpha times X. The only difference is that now X and Y are both ring elements, whereas before one of the factors was a field element. So how is the outer product defined? Well UI and VJ are c-dimensional vectors over the ring R and their outer product is defined to be the c-square dimensional vector over R where for every L and M the element in position CL plus M is the product of the L's element in UI and the M's element in VJ. Now take the L's entry of UI and the M's entry of VJ, which are both T-sparse polynomials over R. We consider that product but not over R but over f of X. Since the reduction modulo in ADL commits without the operation, we can always make the reduction later whenever it is more suitable. Now the product of two polynomials over f of X is still somewhat sparse. Indeed this is a polynomial of degree at most 2N and they are at most T-square non-zero coefficients. That's because all the terms of a product are the product of the monomials of UI and the monomial of VJ and since these two polynomials have at most T non-zero coefficients, the number of non-zero coefficients of the product will be upper bounded by T-square. So our tool is to compress a secret chain of UI outer product with VJ between part P i and P j only and UI outer product with VJ is a vector of this kind. So in particular it is a C-square dimensional vector and its entry is a T-square sparse polynomial of degree at most 2N. So since these are all sparse vectors, we can use the same techniques that we used before for alpha 10s X and alpha 10s Y. In particular we can just compress a secret sharing of each entry and the latter can be rewritten as the sum of T-squares unit vectors of the dimension 2N. These on the slides are those associated with this entry that you see on the top and yeah now we are able to compress secret sharing of unit vectors using DPFs and so we provide the parties with these keys that leak no information about the non-zero elements and the special positions. Furthermore all this material is of small size now. Indeed we just have C-square times T-square pairs of DPF keys and their size is logarithmic in N because we are just working with two party secret sharings. So the last term that remains to be compressed is alpha 10s X times Y and as we did before we noticed that alpha 10s X times Y can be rewritten as the sum over i, j and k of alpha k times X i times Y j where alpha k, X i and Y j are the shares of party pk, pi and pj respectively. This can be again rewritten as the sum over i, j and k of alpha k times the inner product between a and ui times the inner product between a and vj and as we did before this is equal to the sum over i, j and k of alpha k times the inner product between the outer product of a with itself and the outer product with between ui and vj. Finally we can move alpha k inside the inner product so this is equal to the sum over i, j and k of the inner product between the outer product between a and itself and then alpha k times ui outer product with vj. Okay now suppose that the parties have a secret sharing of alpha k times ui outer product with vj between party pi, pj and pk only. Due to the linearity of the inner product and of the sum the parties are able to convert this and to the third secret shareings into a single secret sharing of alpha times X times Y between all the parties and this operation requires no communication. Moreover notice that since this is a three-party secret sharing we leak no information about alpha k, ui and vj to that indeed the only way to leak some information is if all the three parties are corrupt and in that case the adversary already knows alpha k, ui and pj. Notice also that a two-party secret sharing wouldn't be enough here because for instance if it was only between pi and pj and pk is honest if pi and pj are corrupt we would leak information about alpha k that the adversary shouldn't know. So our goal now will be to compress these secret shareings here. Previously we have noticed that the outer product between ui and vj is a vector of this kind in particular a c-square dimensional vector where each entry is a t-square sparse polynomial of degree at most 2n. Now if we multiply everything by alpha k their structure remains the same that's because alpha k is a field element so the only consequence of this multiplication is to change the value of these colored squares but their position and their number remains the same as before. So we conclude that alpha k times the outer product between ui and vj is a c-square dimensional vector where its entry is a t-square sparse polynomial. So in order to compress a secret sharing of these between pk, pi and pj we can use the same techniques as before. In particular we can compress a secret sharing of its entry and the latter can be rewritten as the sum of t-square unit vectors of dimension 2n and the secret sharing can be compressed using a dpf in particular a three-party dpf. So these keys that are obtained leak no information about the non-zero elements and the special positions and their size is small. In total we have c-square times t-square triples of dpf keys but their size is now not logarithmic in n but o of square root of n and the reason is because three-party dpfs are not as efficient as two-party ones. So there is one last issue that we need to fix in our construction specifically dpfs usually outputs secret shareings over binary groups whereas our pcg needs secret shareings over a large prime filter the same one that we use in speeds. So generalizing the known constructions for two parties is rather simple but for the three-party case it is tricky. Specifically the best construction for three-party is by a boon et al and it outputs secret shareings over zero one to the n. Thanks to a trick by boon et al it is possible to generalize this construction to groups of polynomial cardinality but these techniques don't apply to large prime fields. So at the beginning we thought we were completely stuck but then we realized that our pcg is secure even if we allow some leakage in the three-party dpf. In particular if two specific parties of the three-party secret sharing are corrupt we allow the adversary to learn omega the special position of the unit vector. If we allow this leakage it is possible to generalize the three-party dpf by boon et al to large prime fields. The reason why our pcg is still secure is because when p i and p j are both corrupted the adversary already knows the special position omega. Indeed we use the three-party dpf to compress secret shareings of alpha k times the outer product between ui and vj and since alpha k is a field element the special position are uniquely determined by ui and vj. When p i and p j are both corrupted these terms are already known to the adversary. So to summarize our pcg generates n authenticated bigger triples and we were able to compress the terms x and y using the ring and piano assumption into material of size c times t times o of log n. And the complexity in the number of parties is linear. So this applies also for y that has the same form as x. The term x times alpha was compressed using two-party dpfs into material of size c times t times o of log n and the complexity in the number of parties is square. Same happens for y times alpha. Moving on to the product x times y we compress this material into values of size c square times t square times o of log n times n square using two-party dpfs. And finally the last term x times y times alpha was compressed into material of size c square times t square times o of square root of n times n to the third. So we understand that the dominant term is this one. So the final seed size of our pcg is o of square root of n. After having designed our pcg we focused on the protocol for the generation of authenticated bigger triples. In particular we designed an actively secure protocol that sets up the third-party dpfs keys and then we designed another protocol that generates and distributes the pcg seeds with active security and with little communication. I won't describe these constructions in details because they are both rather complex and the techniques that we used are not extremely interesting. Anyway regarding efficiency our protocol generates an authenticated bigger triples with sublinear communication in n, in particular o of square root of n. There is however a term that scales as the number of parties to the fourth so for a very large number of players our solution may not be the best. Regarding computations the complexity scales as n log n. So we analyze the efficiency of the protocol by considering the stretch which is defined as the ratio between the total size of the outputs and the total communication. So the larger the stretch the better. We observe that the stretch becomes greater than one for a very large number of triples in particular for n approaching 2 to the 24 which is close to 16 millions. Anyway even for smaller values of n our protocol is practical based on estimation by Boilethal. Moreover the total communication is roughly 10 times better than overdrive.


Specifically, what we need to do in this first video is just to analyze the need for monitoring the environment. So why should we be monitoring the environment? Well, there's a number of important reasons why we would do that. And of course, this relates to both a particular chemical process as well as wider issues around the local and global implications of chemical processes. So what are some of the reasons why this might be a good or a bad thing? Well, I think, of course, the first thing is that the monitoring may reveal an issue of too many. One of the things that we notice is that for a process like combustion, which is such a common process, the process of combustion is actually dependent on the reactants. Specifically, combustion reactions are directly related to the concentration of oxygen that's available when a fuel is undergoing combustion. So this concentration of oxygen leads us to either incomplete or complete combustion. And of course, once we've had a look at those two processes, we know that there is going to be a difference in either the particulate buildup or the buildup of greenhouse gas. In both cases, water is a product, but in the case of incomplete combustion, we can have carbon being released as a product in the form of soot, or we can have carbon monoxide, which is quite a dangerous gas being released. However, if the concentration of oxygen is high or we change the nature of the fuel, then we get or are more likely to get complete combustion. And that's going to produce water, but it's also going to produce carbon dioxide. Now even then, in a more desired product, we can still have a problem of buildup of carbon dioxide in the atmosphere. We now know there are links between this and other important greenhouse gases that contribute to a real problem at the moment around global warming. And so there are consequences for too much of this sort of thing being released into the environment. We can also have issues of too few. One of the things that we did when we went to the Sydney Water Treatment is we had a look at hard versus soft water. What we realized is that hard water is characterized by the presence of calcium and magnesium ions. Now we don't want a lot of these ions because if there are too many of them, then the water is very hard. It can lead to precipitation in the piping. It can also mean that it's very hard to lather. However, if the concentration of these is too low, then we can also find that there can be some erosion, that actually some of the water can actually start to eat away at the piping. And so therefore sometimes part of the process of water purification is around the addition of calcium ions in order to raise that concentration of calcium. It could reduce the prospects of damage being done at some point further down the line. So there's problems occasionally with too much and there's problems also with too few.


Now we're going to build a parlay for Thursday night football. It is the same game parlay and you want to talk about Kyren as your first leg. Yes, Kyren Williams is the absolute beast when he's on fire, the Rams are winning. And that's the little secret key to success for the Rams to win. Give the ball to Kyren and let him run. So I'm going with Kyren anytime touchdown. Anytime touchdown. OK, I'm going to go Cooper Cup 70 plus receiving guards. That's just what I think he's had back to back hundred yard games. Nobody's talking about it. They might go to the playoffs and cups getting healthy. And the next parlay, OK, I'm going to go with the Rams to win. Just straight up win. The Rams will do what they're on fire. They started slow this season. They got a lot of young players, but they're playing together. Well, now they're going to beat the Saints. Rams hosting the Saints. Oof, Saints defense looked real feisty last week, putting an end to the Divino nonsense. I'm going to go, you know what I mean? I think the Rams do win. And I like this for our parlay. The last leg, I'm going to say Stafford Stafford, two plus past touchdowns because he's thrown multiple touchdowns in not one, not two, not three, but four straight games. So to rehash this, let's take a look. Kyren, anytime touchdown. Cup 70 plus receiving our Rams will win the whole thing against the Saints with TNF and Stafford to have two plus passing touchdowns. It's all going it down at SoFi this game tomorrow night. Right now, guys, all Fandal customers can join this same game parlay. You can ride with us. You can, of course, build your own dear thing over at Fandal Sportsbook. Do not miss out. It's the same game parlay on Fandal America's number one sports book.


سيدا زيناب علي السلام فيها في صديقها وقتها عملت وكذلك تعبت عبد الله بن جعفر صديقها أنقل جعفر الطيار عبد الله أنها عملت كانت بقية أولئة ثم كانت بطريقة ثم كانت بطريقة أولئة التي كانت شيء بسيطة بعض المساعدين يفعلوا بأنوا بطريقة أولئة ثم كانت بطريقة أولئة لكن هذا لم يتوقفها كانت تكلمت في المجال؟ سبحان الله what activity مان day تفسير القرآن Tuesday تجويد of the Quran الله هو أكبر sometimes you could do تفسير of the Quran yes you explain the meanings of the verses of the Quran on Tuesday let's do recital of the Holy Quran yes there are some who cannot read Arabic in our community there are some lovers of Ahl al-Bayt if you sit him with the Quran now I guarantee you cannot read Arabic if you cannot then there's no embarrassment taking lessons go and take lessons go and sit supervised that Quran will speak on the day of judgment سيد زيناب عليه السلام would tell the woman of Medina where are all of you how many of you want to read تفسير of the Quran you want to know the meanings of the verses Monday come home Tuesday how many of you want to do تجويد of the Quran you want to see how to recite beautifully the Quran come home Wednesday how many of you want to learn about the عقائد of Al-Muhammad what is our beliefs how do we explain Tawheed how do we explain Nubuwa how do we explain Imam come home Thursday how many of you want to learn about the laws of the religion of Islam احل البيت عليم السلام have something unique if you cannot reach the Imam of their time they say to you go to the woman for they are as learned as those imams with the knowledge that the imams have given them I've seen this on a number of occasions I remember when that person came to visit came to visit Imam العسكري one day when he came to visit Imam العسكري who was there سيد حكيمة was there the daughter of Imam Al-Jawad yes you know all of them are buried in Samara Imam Al-Hadi Imam العسكري سيد حكيمة سيد نرجس they all buried in Samara when that person Ahmad bin Ibrahim came Imam العسكري was busy Subhan Allah سيد حكيمة says if Imam العسكري cannot answer your question then go to the wife of Imam العسكري she'll provide you with the answer or go to the daughter of Imam العسكري she'll provide you with the answer say to Zainab Monday Quran Tafseer but say that your mom got killed in front of you behind that door surely you'd attack the world surely you'd blame this world surely you'd say why am I always the one under test not Zainab Zainab shows you you know what you can overcome this adversity don't let people come and tell you you should be depressed you should be suicidal you should blame everyone no no no you will be victorious Monday Quran Tafseer Tuesday Tajweed Wednesday Aqa'id Thursday let's study law let's study the laws of Islam what is it do you have questions about your cleanliness ask me do you have questions about domestic issues marriage issues legal issues of Salah and Islam and Hajj come and ask me did her husband Abdullah bin Jaafar say Zainab why are you giving this knowledge away I'm your husband I want more time from you on the contrary he was honored to have Zainab alongside him yes on the contrary he said that my wife is doing Tabligh I just want the message of her grandfather than I am honored to be living in such a house because because precis and blessings is being showered on that household today it's a shame when there are husbands when their wives want to go to the mosque why are you always going to the mosque when their wives want to serve the community why are you serving the community so much when their wives want to go on Monday night so Wednesday night so go and learn knowledge why always going to gain knowledge that is not the example of al Mohammed هناك بلانس يحتاجه في المنزل لكن عبد الله بن جعفر never once in his life that he turned around to Sayyid al Zaynab and said to her why, why on the country he wanted Sayyid al Zaynab to continue teaching as much as she could when her father left Medina to go to Kufa Imam Ali as you know when he became Khalifa he moved to Kufa Sayyid al Zaynab went with him عبد الله بن جعفر could have turned around and said why are we so close to your father I don't want to be close to your in-laws but what in-law is there better than Amir al Mu'minin they used to live right next to Mejil Kufa Imam Ali would give lessons in the mosque Sayyid al Zaynab would give lessons in her house زينة أبيها زيناب the adornment of her father and that's why he had such a soft spot for her that when he was struck on the 19th of Ramadan look at the softness of Ali look at the softness on the 19th of Ramadan when he was struck the moment he got struck as he's leaving the Musalla area as he's leaving he's limping because the injury was such a deep injury as he was leaving he was limping the moment he gets to the door of Mejil al Kufa when you leave Mejil al Kufa you take a left is Imam Ali's house those of you being Ziyara would have seen it the moment he took the left he said حسن حسين let your father stand straight they said dad but you're injured he said let me stand straight why dad he said I see Zayn about the door I don't want her to know I'm injured I've already seen her heart break when she was younger I want her to remain happy when she sees me the moment he enters the house she breaks down she cannot bear because you know if you were an orphan at six your dad is everything to you everything your mom's not there anymore your dad is everything to you she breaks down and سبحان الله أمير المؤمنين one week spot in his life and you can't even call it week in our general terminology but it's one week spot in his life زيناب and أم كالثون yes even when he was dying the tears were flowing from Imam حسن Imam حسين he told them حسن حسين please be patient I beg you be patient the moment he sees Zaynab crying he could not stop crying yes he said I could not bear to see Zaynab crying why because for him زيناب was a reflection of him in every act of his in his salah in his voice in his eloquence and he knew that she was bestowed with her knowledge which was unique سبحان الله the knowledge of Zaynab because today whenever I hear people praising Zaynab you know why they say she's great she's Imam Ali's daughter no she's Fatima Zahra's daughter that's why she's great no she's Rasool Allah's grand-daughter that's why she's great no زيناب is زيناب simple we do not make people great by association we make people great by merit in the school of Ahl al-Bait I don't care أبو لاهب is the uncle of Muhammad he's not great in my eyes I don't care if he's the uncle of the holy prophet peace be upon him in his family yes أهل البيت عليم السلام your greatness is on your merit when someone today say زيناب is great because Zaynab is the daughter of Imam Ali no زيناب is Zaynab she's great by her own merit you know what he means زينا العابدين said about her knowledge والله this line shakes you when you hear this line yes عم زيناب أنت علم غير معلمة وفهم غير مفهمة my auntie Zaynab it should suffice you that you are learned without being taught by anyone and you have understanding without being trained by anyone سبحان الله do you know what Imam Zaynab is saying over here this is a proof that زيناب reached the level of عصمة they call it عصمة الصغراء yes the minor infallibility do you know what that is because of her constant obedience to Allah Allah showered a grace upon her not just a grace to protect her from sin like her mother فاتمة was protected but a second grace what was that second grace even the angels would come and communicate with زيناب عليه السلام yes Imam زينا العابدين in this line عم زيناب my auntie Zaynab أنت علم غير معلمة you are learned without being taught by anyone وأنت فهمة غير مفهمة and you have understanding without anyone training you to have that understanding you know ابن حجر the famous scholar of أهل السنة renown scholar you know what he described say to Zaynab as in those years before كربلا he says you know what زيناب is العقلة العقلة العبيبة الجزلة الله أكبر the Arabic which he uses this is not normal words they are using العقلة العقلة العبيبة الجزلة يا الله go to the books of the dictionaries look at the four words he used to describe Zaynab عقلة what's عقلة عقلة refers to what you have عقل and you have جهل you have them intellect and you have ignorance he says you are the epitome of intellect yes العقلة العقلة you are the intellectual the honorable العبيبة الجزلة you are the one who has depths of understanding but with a dignity that nobody can match سبحان الله normally when someone's intellectual their dignity leaves a lot to be desired sometimes they're arrogant with that intellectuality they've received their degrees they've gone to the best universities it's very rare for you to find a balance of intellect and dignity ابن حجر says you know what زيناب is زيناب is العقلة العقلة العبيبة الجزلة لا يوجد عقلة تقرأة اقلات في احد قرار زيناب تقرأة في أيضا you know what you were saying when you look for العنسان الكامل the perfect human being just stare at the face of زيناب you have perfection in front of you


Okay, let's speak a lot. Let's go. Okay, thank you. Let's go. The President of the United States. Interplaying in the Senate request to waive the useful five-dollar charge on the nine-and-four-museum service prepared to President Blunt. Therefore, if there is no objection, we don't have to speak a five-dollar charge. Thank you very much. I stepped back up here. I had to have a couple of reminders here in front of me. So I'm using the podium here because I have a quote, and I wouldn't want to make it and get it wrong. But it's a great pleasure to be here with all of you again. I thank you. And may I express my appreciation to the first Republican Senator Baker, who I think has been doing a magnificent job, and I've been most appreciative of the cooperation that we have had. And I, for one, I'm going to do all I can do to see that there is still a majority of you in the Senate next year. I'd like to pay tribute also to your chairman, John Tower. I think of him as a statesman whose judgment I deeply respect and I have been most pleased to call upon him for his vast knowledge and his good judgment with regard to our national security affairs. In opening my remarks, I told you there was a quote I would like to quote a few words by a very famous and celebrated orator, journalist, soldier, historian, and statesman. People have even said he might have made a great actor if he tried that. Winston Churchill he said, the idea that a nation can tax itself into prosperity is one of the crudest delusions which has ever befuddled the human mind. Now, I don't know how that quote happened to catch my eye. It realized it has nothing to do with the meeting here today but seriously we are still faced with problems, social and economic, which have been piling up for almost half a century. Last year we put together a bipartisan coalition and for the first time in that half century we charted a new course for this country. We've only barely set foot on that new path that we chose for the country but those who had much to do with the policies of the past were now shouting Turn Back members of the other party they haven't even waited to see where the path goes and it's true that we're in a recession the people are feeling the effects and they're not pleasant and for those who are unemployed in my view they're completely tragic but I believe the course we've embarked on offers the best hope for all of them there will always be room for improvement in any budget or economic policy but we must have a budget where further savings are to be found or a better way of meeting a greed upon goals can be worked out I pledge my full cooperation to you and I want to hear from you but our first obligation must be to the American people we're coming out of a long night of government mismanagement and blundering there's no quick fix but I cannot accept the idea that a program which hasn't really started is responsible for the displeasure of today planned deficits and deliberate inflation as a supposed means of improving prosperity was the policy of the democrat controlled congresses for most of this last half century has there been any indication that they are not demanding a return to those past policies if they are they're doomed to failure these aren't easy times as I said before but together I believe we can hold down taxes we can hold down spending and ensure a national defense that is able to preserve the peace I'll be glad to consider any comprehensive congressional plan that meets this crucial standard and I promise you that when where we have honest differences you can count on me to be willing to listen and a sincere partner but we must stand firm I think in every basic commitments together we must get on with the job of bringing the budget under control we're already winning the battle against inflation we can and we will bring interest rates down and that is the absolute must in the problems confronting us and we must continue to return the resources and responsibilities to the people that will mean more savings more freedom more economic opportunity more jobs I think that for the first time in this the eighth recession since World War II it is the first time that there has been in place before the recession started a program that is designed to bring us out of that recession and bring us out not with an artificial fix the kind of thing that we've seen seven times before each time the next time we dive it's deeper but will bring us out back to a sound economy and with our people who want jobs having jobs and with this government on the track that it should be on so with that I'm going to sit down and we'll get on with the rest of the of the meeting let's ask the press to exit the room now please if we could excuse the press then we'll go to our general discussion


answer the discussion regarding GS2 bilateral relations. Question number nine, with the last few decades where of Asia's growth story, the next few are expected to be of Africa's. In the light of this statement, examine India's influence in Africa in the recent years. So the question is regarding in the century, the last few four or five decades, the Asian countries like India, China, so these countries showed growth and development. So now they are telling that the coming few decades, the next four or five decades is going to be Africa's third. Okay, particularly why they are telling this because in Africa, the growth rate of African countries are increasing, the FDA increases, FDA investment in African countries have considerably increased and Africa is a resource rich countries. Okay, so Africa have all the capacity to become a developed nation. So in the coming decades, Africa is going to be a that means the growth rate of Africa is going to be very, very high. Okay, important question is examine India's influence in Africa in the recent years. So what are India's contributions, how India influences Africa, we got this. So first we can bring down this pan African network. So to fill up the digital gaps in regarding information technology, India have taken this initiative, pan African network. And then we also have one more initiative called Indian Technical and Economic Cooperation Initiative. And then regarding maritime cooperation also, we are having a good influence over the African countries. We are having an association called IBOREA, Indian Ocean Rim Association countries in security in development, etc. We are cooperating with all the African nations. And Indian diaspora are there in particular in East African nation and also in South Africa. So they also influence that means those countries with respect to India. And then in non-alignment movement also India and the African countries are cooperating with each other very closely. And then one important initiative is this Asia-Africa group. So along with Japan, we are trying to counter the Belt and Road Initiative, the Silk Road Maritime Road initiative. So for Africa, connecting Africa, South India or South Asia, Southeast Asian countries and Java. So we are developing maritime infrastructure partners. And then obviously the medical diplomacy. So India is helping all these countries with respect to COVID vaccines. We are helping them directly, bilaterally and also through United Nations. So these are all India's influence in Africa. Question number 10. The USA is facing an existential threat in the form of China. This is much more challenging than the US-12 Soviet Union. So this is regarding they are trying to compare Cold War with the New Cold War. So Cold War was between US and US and Soviet Union. And US are finally collapsing in 1918. But more than the threat posed by Soviet Union over USA. Now in the New Cold War, China is posing more threat towards USA. Why? So just we have to compare the capacity of Soviet Union and today's China with respect to USA. So that will give the answer. So the biggest challenge faced by US is in four areas we can see. So number one, with respect to Soviet Union, Soviet Union took ideology, military as a used these two mechanisms. They stressed on these two things more. That is communist ideology and also its military, which relate too much on this. But whereas China, you have to note that all that is a communist country. It is giving more importance to technological and other growth models and also military and military budgets. Whereas US are only depended on ideology and military whereas China is going for growth models also. Economically also it is building itself. And then secondly, openly regarding economy, the Soviet Union had an isolated economy. It did not have big trade relationship with world countries. Whereas China, you have to note that China's economy is integrated with the world. And most importantly, China is the world's largest exporter. China is earning huge amount of foreign currencies from all other countries because of its surplus exports. And China is having almost all raw materials and it is having a very skilled population. So China that's why is connected with the entire world countries very closely, closely, complexly interconnected. And then coming to the geopolitics, you have to note that the Soviet Union's politics completely failed because it completely relied on hard power alone. And in many areas, Soviet Union was not able to win over USA. But whereas China, you have to note that it is also a hard power. But at the same time, it is also using diplomacy and also other strategic like checkbook diplomacy, etc. like that, giving money, using economy to control other world countries. Particularly after US withdrawal from Afghanistan and US incapacity or incapability to do anything against North Korea, we can clearly say that China has won over US in particular in Afghan crisis and also in North Korean crisis. These two things clearly shows that in geopolitics, China is harder than US. Whereas Soviet Union with respect to all other problems during the Cold War, Soviet Union failed with respect to USA. In terms of capacity, Russia mainly depends upon its military and oil. But whereas China, you have to note that its capacity in terms of technology, in terms of population, in terms of connectivity with the world, China is having more advantage than Russia. That is so far more Soviet Union. So China is more challenging to US than Soviet Union was challenging to US. Question number 19, critically examine the aims and objectives of the ACO. And what important does it holds for India? So first, we have to find out the objectives of the ACO. And we have to critically examine why the objectives of the ACO is not going in lines. For example, one of the main objectives of Shanghai Cooperation Organization is regional cooperation. Okay, against the Western country, China dominated, China led coalition called Shanghai Cooperation Organization is there. But you have to note that in this group, India is there, Pakistan is there, China, Russia is there. So these aligns may not work well because India, Pakistan are having different understanding, particularly India and China are also having different, different interests. How these aligns will make regional cooperation. So this is a major question. So the main objective of ACO itself is something looking difficult. And second is compacting terrorism is another objective of Shanghai Cooperation Organization. But with respect to the recent developments in Afghanistan, and also this ISAS, clearly we can say that the Shanghai Cooperation Organization is the objective of combatting terrorism and what China is doing with respect to recognizing Taliban, China and Pakistan and also Russia. And the India's interest regarding Afghanistan completely is not compacting. And third one, peace and security. So Shanghai Cooperation Organization is one of the main objectives, peace and security. But here you see China's, on seeing the China's record, China is a belligerent, growing power, superpower. And China's involvement in the Taiwan crisis and also in Hong Kong crisis clearly shows that Shanghai Cooperation Organization, what China is doing under peace and security is not compacting. And with respect to trade commerce, tourism and culture, you have to note that although some cooperation can be met, but yet in Belt and Road Initiative, India is not joining China's initiative. Okay. And also in COVID-19 situation also, difference of opinions whether that between India and China. So clearly these things clearly shows that the objectives of Shanghai Cooperation Organization and what is really happening is completely not compacting. And what is India's importance? Why India have to be in SEO that we have to find out? So point number one, we can engage with China and Russia together in the same forum. And then two, we can have link to the Eurasian region. And to combat terrorism, this can be used. India tactically have to develop certain methods. Diplomatically, we have to handle the China and Pakistan and other countries. And we have to combat terrorism. And then in energy security also, this may be very, very helpful. And finally, cultural connect also is possible. So that's why India have to be with Shanghai Cooperation Organization. Question number 20, the newly the tri-nation partnership, ACUS, is aimed at countering China's ambition in the Indo-Pacific region. Is it going to supersede the existing partnership in the region? Discuss the strength and impact of ACUS in the present scenario. See, ACUS is a tri-national security partnership, defence partnership agreement between Australia, UK and also the US. So the ultimate objective is to already Australia and US are in another initiative called Quad in which India and Japan are also members. So this Quad's ultimate objective is to counter China in the Indo-Pacific region. Not all of China to have a foothold or dominate Indian Ocean and Pacific Ocean. On the other side, by having this tri-lateral partnership, I mean, ACUS, US and Australia are bringing UK into the Indo-Pacific region. So this is the major achievement. So one more powerful country, UK is also there along with the US and Australia who are partners with India and Quad to counter China. So the first question is, is it going to supersede the existing partnership in the region? Whether ACUS is going to supersede Quad? This is question number one. We can argue in both ways. So one, we can say that the two of the Quad members are not members in ACUS. So this we can see it as a setback. One, that means particularly this ACUS is mainly to share the summer and technology. The summer and technology is denied to India and Japan. So this we can see it as a setback. And then two, this ACUS may be the already formed a group called Five East Alliance. Along with Australia, New Zealand, US, they are having a group. This ACUS is undermining that idea. And moreover, most importantly, France is having a lot of reservation towards this ACUS. And because this ACUS is formed, the regional stability also may not go well because China may feel affunded meant China will increase its presence in Indo-Pacific region. This may go against India. So all these things clearly shows that this ACUS to some extent is superseding Quad. But on the other side, the Quad partners of India, Australia and US, they are equipping themselves against China along with a new power, UK. The credible deterrence against China is increasing, particularly with respect to hostility. The enemies of China are coming to them. So definitely we can say that if China and India are going for a problem to more humans, Quad and the extended Quad, this is ACUS. If they are strong men, it is good for India. And we can deter China. So definitely ACUS completely is not outsmarting the Quad's achievement. ACUS is actually giving more meaning to Quad and more, that means more supportive to Quad rule and the impacts on ACUS. See, this strengthens Australia and Australia's relationship with the US and UK and obviously Australia's capacity. Australia now can access to artificial intelligence and also long range missile capabilities and also submarine technology. And since ACUS and Quad are overlapping, obviously it is a big threat for China and China have to. And China, that's why what China is doing is China is reacting too much with respect to the Taiwan issues, creating problem with Japan, which is a partner to India in Quad. Okay, now China is facing a very powerful new defense alliance. Already Quad, four countries are there, India, Japan, US and Australia. Now in another form, Australia, UK and US. So this is definitely a big deterrence for China.