The document provides an agenda for a talk on introduction to secure multi-party computation (SMPC). The talk will cover an overview of SMPC, including definitions and applications like the millionaires problem. It will discuss adversary classifications, desirable properties, techniques like garbled circuits and oblivious transfer, and open problems. The speaker's background and research interests in topics like blockchain and SMPC are also mentioned. The document includes schedules, locations and contact details for the event.
WEAKNESS ON CRYPTOGRAPHIC SCHEMES BASED ON REGULAR LDPC CODESIJNSA Journal
We propose a method to recover the structure of a randomly permuted chained code and how to cryptanalyse cryptographic schemes based on these kinds of error coding. As application of these methods is a cryptographic schema using regular Low Density Parity Check (LDPC) Codes. This result prohibits the use of chained code and particularly regular LDPC codes on cryptography
Introduction to Public key Cryptosystems with block diagrams
Reference : Cryptography and Network Security Principles and Practice , Sixth Edition , William Stalling
WEAKNESS ON CRYPTOGRAPHIC SCHEMES BASED ON REGULAR LDPC CODESIJNSA Journal
We propose a method to recover the structure of a randomly permuted chained code and how to cryptanalyse cryptographic schemes based on these kinds of error coding. As application of these methods is a cryptographic schema using regular Low Density Parity Check (LDPC) Codes. This result prohibits the use of chained code and particularly regular LDPC codes on cryptography
Introduction to Public key Cryptosystems with block diagrams
Reference : Cryptography and Network Security Principles and Practice , Sixth Edition , William Stalling
THE KEY EXCHANGE CRYPTOSYSTEM USED WITH HIGHER ORDER DIOPHANTINE EQUATIONSIJNSA Journal
One-way functions are widely used for encrypting the secret in public key cryptography, although they are regarded as plausibly one-way but have not been proven so. Here we discuss the public key cryptosystem based on the system of higher order Diophantine equations. In this system those Diophantine equations are used as public keys for sender and recipient, and both sender and recipient can obtain the shared secret through a trapdoor, while attackers must solve those Diophantine equations without trapdoor. Thus the scheme of this cryptosystem might be considered to represent a possible one-way function. We also discuss the problem on implementation, which is caused from additional complexity necessary for constructing Diophantine equations in order to prevent from attacking by tamperers.
Enhanced RSA Cryptosystem based on Multiplicity of Public and Private Keys IJECEIAES
Security is one of the most important concern to the information and data sharing for companies, banks, organizations and government facilities. RSA is a public cryptographic algorithm that is designed specifically for authentication and data encryption. One of the most powerful reasons makes RSA more secure is that the avoidance of key exchange in the encryption and decryption processes. Standard RSA algorithm depends on the key length only to protect systems. However, RSA key is broken from time to another due to the development of computers hardware such as high speed processors and advanced technology. RSA developers have increased a key length or size of a key periodically to maintain a high security and privacy to systems that are protected by the RSA. In this paper, a method has been designed and implemented to strengthen the RSA algorithm by using multiple public and private keys. Therefore, in this method the security of RSA not only depends on the key size, but also relies on the multiplicity of public and private keys.
Secure E-voting System by Utilizing Homomorphic Properties of the Encryption ...TELKOMNIKA JOURNAL
The use of cryptography in the e-voting system to secure data is a must to ensure the authenticity
of the data. In contrast to common encryption algorithms, homomorphic encryption algorithms had unique
properties that can perform mathematical operations against ciphertext. This paper proposed the use of
the Paillier and Okamoto-Uchiyama algorithms as two homomorphic encryption algorithms that have the
additional properties so that it can calculate the results of voting data that has been encrypted without
having to be decrypted first. The main purpose is to avoid manipulation and data falsification during vote
tallying process by comparing the advantages and disadvantages of each algorithm.
THE KEY EXCHANGE CRYPTOSYSTEM USED WITH HIGHER ORDER DIOPHANTINE EQUATIONSIJNSA Journal
One-way functions are widely used for encrypting the secret in public key cryptography, although they are regarded as plausibly one-way but have not been proven so. Here we discuss the public key cryptosystem based on the system of higher order Diophantine equations. In this system those Diophantine equations are used as public keys for sender and recipient, and both sender and recipient can obtain the shared secret through a trapdoor, while attackers must solve those Diophantine equations without trapdoor. Thus the scheme of this cryptosystem might be considered to represent a possible one-way function. We also discuss the problem on implementation, which is caused from additional complexity necessary for constructing Diophantine equations in order to prevent from attacking by tamperers.
Enhanced RSA Cryptosystem based on Multiplicity of Public and Private Keys IJECEIAES
Security is one of the most important concern to the information and data sharing for companies, banks, organizations and government facilities. RSA is a public cryptographic algorithm that is designed specifically for authentication and data encryption. One of the most powerful reasons makes RSA more secure is that the avoidance of key exchange in the encryption and decryption processes. Standard RSA algorithm depends on the key length only to protect systems. However, RSA key is broken from time to another due to the development of computers hardware such as high speed processors and advanced technology. RSA developers have increased a key length or size of a key periodically to maintain a high security and privacy to systems that are protected by the RSA. In this paper, a method has been designed and implemented to strengthen the RSA algorithm by using multiple public and private keys. Therefore, in this method the security of RSA not only depends on the key size, but also relies on the multiplicity of public and private keys.
Secure E-voting System by Utilizing Homomorphic Properties of the Encryption ...TELKOMNIKA JOURNAL
The use of cryptography in the e-voting system to secure data is a must to ensure the authenticity
of the data. In contrast to common encryption algorithms, homomorphic encryption algorithms had unique
properties that can perform mathematical operations against ciphertext. This paper proposed the use of
the Paillier and Okamoto-Uchiyama algorithms as two homomorphic encryption algorithms that have the
additional properties so that it can calculate the results of voting data that has been encrypted without
having to be decrypted first. The main purpose is to avoid manipulation and data falsification during vote
tallying process by comparing the advantages and disadvantages of each algorithm.
Module 6
Advanced Networking
Security problems with internet architecture, Introduction to Software defined networking, Working of SDN, SDN in data centre, SDN applications, Data centre networking, IoT.
Lightweight Cryptography for Distributed PKI Based MANETSIJCNCJournal
Because of lack of infrastructure and Central Authority(CA), secure communication is
a challenging job in MANETs. A lightweight security solution is needed in MANET to balance its
nodes resource tightness and mobility feature. The role of CA should be decentralized in MANET
because the network is managed by the nodes themselves without any fixed infrastructure and centralized
authority. In this paper, we created a distributed PUblic Key Infrastructure (PKI) using
Shamir secret sharing mechanism which allows the nodes of the MANET to have a share of its private
key. The traditional PKI protocols require centralized authority and heavy computing power to
manage public and private keys, thus making them not suitable for MANETs. To establish a secure
communication for the MANET nodes, we proposed a lightweight crypto protocol which requires
limited resources, making it suitable for MANETs.
This Presentation highlights the project in which i am currently working on.
Secure 2-party AES:
AES is one of the most widely used block cipher.It takes a secret key as input and a message block to be encrypted and generates the ciphertext corresponding to the message, without disclosing anything about the key or the message.
Typically the key and the message to be encrypted are available with a single entity.
Now consider a scenario where we have two parties, one holding the secret key and the other holding the message to be encrypted.
We want to design a protocol such that at the end of the protocol, the second party learns the encryption of the message (and no information about the key) while the first party learns nothing about the encrypted message.
The goal of this project will be to implement such a protocol.
To understand and present the techniques on how to improve round complexity in verifiable secret sharing paradigm as academic assignment. I am also assigned on a project where i will need to implement this protocol.
VSS :
In secret sharing , there is a dealer who shares a secret among a group of n parties in a sharing phase. The requirements are that, for some parameter t < n,any set of t colluding parties gets no information about the dealer’s secret at the end of the sharing phase, yet any set of t+1 parties can recover the dealer’s secret in a later reconstruction phase. Secret sharing assumes the dealer is honest; verifiable secret sharing (VSS) also requires that, no matter what a cheating dealer does (in conjunction with t+1 other colluding parties), there is some unique secret to which the dealer is “committed” by the end of the sharing phase. VSS serves as a fundamental building block in the design of protocols for general secure multi-party computation as well as other specialized goals.
This Presentation presents an overview of multivariate glyphs, a list of issues regarding the layout of glyphs,and a comprehensive taxonomy of placement strategies to assist the visualization designer in selecting the technique most suitable to his or her data and task motivated by the paper listed in reference section.
Manufacturing Compromise The Emergence of Exploit-as-a-ServiceJITENDRA KUMAR PATEL
An exploit is a piece of software, a chunk of data, or a sequence of commands that takes advantage of a bug or vulnerability in order to cause unintended or unanticipated behavior to occur on computer software, hardware, or something electronic.
In order to understand the impact of the exploit-as-a-service
paradigm on the malware ecosystem, Author performed a detailed analysis of the prevalence of exploit kits, the families of malware installed upon a successful exploit, and the volume of traffic that malicious web sites receive. To carry out this study, they analyze 77,000 malicious URLs received from Google Safe Browsing, along with a crowd-sourced feed of blacklisted URLs known to direct to exploit kits. These URLs led to over 10,000 distinct binaries, which they ran in a contained environment.
“Node's goal is to provide an easy way to build scalable Network programs”
Asynchronous i/o framework
Core in c++ on top of v8
Rest of it in javascript
Swiss army knife for network Related stuffs
Can handle thousands of Concurrent connections with Minimal overhead (cpu/memory) on a single process
It’s NOT a web framework, and it’s also NOT a language
• Created by Ryan Dahl in 2009
• Development && maintenance sponsored by Joyent
• License MIT
• Last release : 0.10.31
• Based on Google V8 Engine
• +99 000 packages
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Acetabularia Information For Class 9 .docxvaibhavrinwa19
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
2. Agenda of the day ... ?
Here is Schedule of Security Talks:
10:00 – 10:15 – SecurityXploded Community Overview – Monnappa K A
10:15 – 11:00 – Breaking into hospital infrastructure – Anirudh Duggal
11:00 – 11:30 – Introduction to Secure Multi Party Computation – Jitendra Kr. Patel
11:30 – 11:45 – Break
11:45 – 12:30 – Blue-tooth [in]security – Jiggyasu Sharma
12:30 – 01:30 – Analysing Linux Malwares using Limon Sandbox – Monnappa K A
01:30 – 01:45 – Feedback and important announcement
Venue:
Philips Innovation Campus
Manyata Tech Park, Nagavara,
Bengaluru, Karnataka 560045
Contact Details:
Email: team@securityxploded.com
3. Jitendra Patel ... ?
M.Tech from International Institute of Information Technology, Bangalore (Pursuing)
Experience in Teaching ( 3+ years)
Worked as an Offline Instructor at Innobuzz Knowledge Solutions - Delhi, Classroom
faculty at Oviyans Infotech – Indore, Trainer at Osinfotech – Indore, Performance
Engineering R&D at RedHat, Bangalore.
Research interest in Ethical Hacking, Network Security, Reverse Engineering, Wireless
Security, Technical Analysis, Bitcoin Blockchain Technology, SMPC
Tech Enthusiast
4. Agenda of the Talk... ?
Story
What is Secure Multi Party Computation ?
The Millionaires Problem and Few real world problems
Adversary classification
Issues and desirable properties from SMPC
Few SMPC Terminologies/Techniques
What is next ?
5. Should I invite herfora cup of coffee… ?
Alice and Bob meet accidentally. Both don’t know India. Both are tourists.
Bob is lost. He would like to ask Alice for the way to his guest house. And maybe whether she would
like to drink a hot coffee with him. But he doesn’t know her. And if she says no? “I would ask her, if
only I knew that she would accept”, he thinks. But he is shy. Too shy.
Alice is lost as well. She would like to ask Bob for the way to the hostel. And maybe whether Bob
would not be willing to accompany her. It’s already getting dark. She would of course then invite him
for a cup of hot milk with honey. And some banana cake. In order to thank him. And maybe...who
knows. But what if he says no? Should she dare to ask? “If I knew that he would not laugh at me, I
would ask”. But Alice is shy. Too shy.
They cross each other. Watching each other. Not asking each other. Finally, they both find their way.
Bob to his guest house, Alice to the hostel. The wrong way. They will never meet Again.
If only they would know the techniques of secure multi-party computation.
Story
6. Secure Multi Party Computation… ?
Also known as secure computation or multi-party computation
Fundamental problem in distributed computing and cryptography
Definition
- Set of n parties
- Some are faulty/corrupted
- Do not trust each other
- Still parties wish to compute some function
- Private local inputs (Privacy)
- Public Output (Correctness)
8. Real World Problem….?
Online Dating
Electronic Voting
Privacy-preserving Statistics [ ex: satellite collision ]
Privacy-preserving Database Operations
Benchmarking
Privacy-preserving data mining
Secure e-auction
9. Secure Function Evaluation
A set of (two or more) parties with private inputs wish to compute
some joint function of their inputs.
Parties wish to preserve some security properties. E.g., privacy and
correctness.
– Example: Computing the maximum
Many results depending on
– Number of players
– Means of communication
– the power and MODEL of the adversary
– how the function is REPRESENTED
11. Computational Setting
Any two-party function can be securely computed in the semi-
honest adversarial model [Yao]
Any multiparty function can be securely computed in the
malicious model, for any number of corrupted parties [GMW]
12. Adversary Classification ... ?
Nature of Adversary : Passive
Fail-stop
Active
Mixed
Mobility : Static
Adaptive/Dynamic:
Mobile
Corruption Capacity : Threshold
Non-threshold
Computational Resources : Bounded
Unbounded
13. Issues with the Design of SMPC…?
Possibility : What are the necessary and sufficient conditions
for the existence of a protocol in a given network?
Feasibility : Does there exist a polynomial time and efficient
protocol ? (We assume that the protocol exists).
Optimality : How do we design a protocol whose total
complexities (communication and round) match their respective
lower bound?
14. Desirable Properties of a SMPC…?
Correctness
Privacy
Input Independence
Robustness
Fairness
16. Garbled Circuit…?
We can garble a circuit (hide its structure) so that two parties, sender and
receiver, can learn the output of the circuit and nothing else.
At a high level, the sender prepares the garbled circuit and sends it to the
receiver, who obliviously evaluates the circuit, learning the encodings
corresponding to both his and the senders output.
He then just sends back the senders encodings, allowing the sender to
compute his part of the output.
The sender sends the mapping from the receivers output encodings to bits to
the receiver, allowing the receiver to obtain their output.
Ref : Wikipedia
17. Semi-Honest Construction
1-out-of-2 Oblivious Transfer (OT)
Inputs
– Sender has two messages m0 and m1
– Receiver has a single bit σ∈{0,1}
Outputs
– Sender receives nothing
– Receiver obtain mσ and learns nothing of m1-σ
18. Semi-Honest OT
Let (G,E,D) be a public-key encryption scheme
– G is a key-generation algorithm (pk,sk) ← G
– Encryption: c = Epk(m)
– Decryption: m = Dsk(c)
Assume that a public-key can be sampled without
knowledge of its secret key:
– Oblivious key generation: pk ← OG
– El-Gamal encryption has this property
19. Semi-Honest OT
Protocol for Oblivious Transfer
Receiver (with input σ):
– Receiver chooses one key-pair (pk,sk) and one public-key pk’ (obliviously
of secret-key).
– Receiver sets pkσ = pk, pk1-σ = pk’
– Note: receiver can decrypt for pkσ but not for pk1-σ
– Receiver sends pk0,pk1 to sender
Sender (with input m0,m1):
– Sends receiver c0=Epk0(m0), c1=Epk1(m1)
Receiver:
– Decrypts cσ using sk and obtains mσ.
20. Security Proof
Intuition:
– Sender's view consists only of two public keys pk0 and pk1. Therefore, it
doesn't learn anything about that value of σ.
– The receiver only knows one secret-key and so can only learn one
message
Formally:
– Sender's view is independent of receiver's input and so can easily be
simulated (just give it 2 keys)
– Receiver's view can be simulated by obtaining the output m and sending
it Epk0(m),Epk1(m).
Note: Assumes semi-honest behavior. A malicious receiver can choose two keys together with theirsecret keys.
21. Secret Sharing.... ?
In secret sharing
- Dealer who shares a secret among a group of n parties
- Sharing Phase
- Reconstruction Phase
The requirements are that :
- For t <n, any set of t colluding parties
- No information about the dealer’s secret at the end of the sharing
- Any set of t+1 parties can recover the dealer’s secret
Assumption :
- The dealer is honest
22. Verifiable Secret Sharing (VSS) .... ?
Just like secret sharing but requires :
- No matter what a cheating dealer does (in conjunction with t other
colluding parties), there is some unique secret to which the dealer is
“committed” by the end of the sharing phase.
Perfect VSS, where the security guarantees are :
- Unconditional
- Privacy is perfect
- Protocol is error-free.
Perfect VSS is known to be possible if and only if t < n/3
23. Whats Cooking in the Kitchen ... ?
Bitcoin and Block Chain Technologies
Yao's Millionaire Problem and Proposed Solution
Secret Sharing and VSS (almost done but still need help)
Secure 2 Party Computation (AES) (protocol implementation)
GMW Protocol
Efficient Micro-payments with Bitcoins (current research)
24. References - 1 ...
Y. Lindell and B. PinkasY. Lindell and B. Pinkas
A Proof of Yao's Protocol for Secure Two-Party Computation (Paper)A Proof of Yao's Protocol for Secure Two-Party Computation (Paper)
Iftach HaitnerIftach Haitner
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations (Paper)Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations (Paper)
Yan Huang, David Evans, Jonathan Katz, Lior MalkaYan Huang, David Evans, Jonathan Katz, Lior Malka
Faster Secure Two-Party Computation Using Garbled Circuits (Paper)Faster Secure Two-Party Computation Using Garbled Circuits (Paper)
Ninghui Li , Purdue UniversityNinghui Li , Purdue University
Topic 24: Secure Function Evaluation (Slides)Topic 24: Secure Function Evaluation (Slides)
Benny Pinkas, HP Labs, PrincetonBenny Pinkas, HP Labs, Princeton
Introduction to Secure Computation (Slides)Introduction to Secure Computation (Slides)
Moni Naor , Weizmann Institute of ScienceMoni Naor , Weizmann Institute of Science
Lecture 15: Oblivious Transfer and Secure Function Evaluation (Slides)Lecture 15: Oblivious Transfer and Secure Function Evaluation (Slides)
Scribes from Dr. Ashish Choudhury lecturesScribes from Dr. Ashish Choudhury lectures
https://sites.google.com/site/ashishcrypto/Courses/2015-cs-nc-813https://sites.google.com/site/ashishcrypto/Courses/2015-cs-nc-813
ApologiesApologies for Others unmentioned sources from internet for articles and referencesfor Others unmentioned sources from internet for articles and references
25. References -2 ...
Improving The Round Complexity of VSS in Point-To-Point Networks
Jonathan Katz
Chiu-Yuen Koob
Department of Computer Science,
University of Maryland, College Park, MD 20742, USA
Ranjit Kumaresana
Google Labs, Mountain View, CA 94043, USA
Link : http://www.journals.elsevier.com/information-and-computation