|
Archistar
Archistar is a software framework to build distributed storage system on the basis of secure fragmentation and information dispersal. It is dedicated to the development of a secure distributed storage architecture for trustworthy cloud usage. The Archistar framework combines methods from Byzantine fault tolerance, secret sharing, and additional tools from cloud cryptography to achieve its goal and parts of it are released as open-source software. A non-functional goal is to provide a base framework for further research into this topic: to achieve this, focus has been set on readability and open-source licenses have been used for all prototype code. The first version of the Java implementations have been developed in a research project funded by the Austrian Ministry of Transport and the current version is maintained and extended as part of the EU funded research project PRISMACLOUD Components To achieve better readability self-contained aspects were extracted into libraries: * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Byzantine Fault Tolerance
A Byzantine fault (also Byzantine generals problem, interactive consistency, source congruency, error avalanche, Byzantine agreement problem, and Byzantine failure) is a condition of a computer system, particularly distributed computing systems, where components may fail and there is imperfect information on whether a component has failed. The term takes its name from an allegory, the "Byzantine generals problem", developed to describe a situation in which, in order to avoid catastrophic failure of the system, the system's actors must agree on a concerted strategy, but some of these actors are unreliable. In a Byzantine fault, a component such as a server can inconsistently appear both failed and functioning to failure-detection systems, presenting different symptoms to different observers. It is difficult for the other components to declare it failed and shut it out of the network, because they need to first reach a consensus regarding which component has failed in the first pla ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Secret Sharing
Secret sharing (also called secret splitting) refers to methods for distributing a secret among a group, in such a way that no individual holds any intelligible information about the secret, but when a sufficient number of individuals combine their 'shares', the secret may be reconstructed. Whereas ''insecure'' secret sharing allows an attacker to gain more information with each share, ''secure'' secret sharing is 'all or nothing' (where 'all' means the necessary number of shares). In one type of secret sharing scheme there is one ''dealer'' and ''n'' ''players''. The dealer gives a share of the secret to the players, but only when specific conditions are fulfilled will the players be able to reconstruct the secret from their shares. The dealer accomplishes this by giving each player a share in such a way that any group of ''t'' (for ''threshold'') or more players can together reconstruct the secret but no group of fewer than ''t'' players can. Such a system is called a -threshol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Open-source Software
Open-source software (OSS) is computer software that is released under a license in which the copyright holder grants users the rights to use, study, change, and distribute the software and its source code to anyone and for any purpose. Open-source software may be developed in a collaborative public manner. Open-source software is a prominent example of open collaboration, meaning any capable user is able to participate online in development, making the number of possible contributors indefinite. The ability to examine the code facilitates public trust in the software. Open-source software development can bring in diverse perspectives beyond those of a single company. A 2008 report by the Standish Group stated that adoption of open-source software models has resulted in savings of about $60 billion per year for consumers. Open source code can be used for studying and allows capable end users to adapt software to their personal needs in a similar way user scripts an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ministry Of Transport (Austria)
The Ministry of Climate Action and Energy () is the government ministry of Austria in charge of traffic, research, innovation, energy, and environmental protection. Overview First established in 1896, its exact name and portfolio have undergone changes numerous times throughout the years. From 2000 to 2020, the ministry was officially called the Ministry for Transport, Innovation and Technology (''Bundesministerium für Verkehr, Innovation und Technologie'' or ''BMVIT''). It is tasked, in addition to its core regulatory and infrastructure responsibilities, with the promotion of scientific research and technological progress. The ministry regulates motor vehicles, railways, waterways, aviation safety, air traffic control, air weather services, public transport, the postal system, and the telecommunications sector. It maintains the Autobahns of Austria, autobahns and other national highways. The Ministry also owns and supervises the via donau, a corporation charged with the maint ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Secret Sharing
Secret sharing (also called secret splitting) refers to methods for distributing a secret among a group, in such a way that no individual holds any intelligible information about the secret, but when a sufficient number of individuals combine their 'shares', the secret may be reconstructed. Whereas ''insecure'' secret sharing allows an attacker to gain more information with each share, ''secure'' secret sharing is 'all or nothing' (where 'all' means the necessary number of shares). In one type of secret sharing scheme there is one ''dealer'' and ''n'' ''players''. The dealer gives a share of the secret to the players, but only when specific conditions are fulfilled will the players be able to reconstruct the secret from their shares. The dealer accomplishes this by giving each player a share in such a way that any group of ''t'' (for ''threshold'') or more players can together reconstruct the secret but no group of fewer than ''t'' players can. Such a system is called a -threshol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Byzantine Fault Tolerance
A Byzantine fault (also Byzantine generals problem, interactive consistency, source congruency, error avalanche, Byzantine agreement problem, and Byzantine failure) is a condition of a computer system, particularly distributed computing systems, where components may fail and there is imperfect information on whether a component has failed. The term takes its name from an allegory, the "Byzantine generals problem", developed to describe a situation in which, in order to avoid catastrophic failure of the system, the system's actors must agree on a concerted strategy, but some of these actors are unreliable. In a Byzantine fault, a component such as a server can inconsistently appear both failed and functioning to failure-detection systems, presenting different symptoms to different observers. It is difficult for the other components to declare it failed and shut it out of the network, because they need to first reach a consensus regarding which component has failed in the first pla ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Netty (software)
Netty is a non-blocking I/O client-server framework for the development of Java network applications such as protocol servers and clients. The asynchronous event-driven network application framework and tools are used to simplify network programming such as TCP and UDP socket servers. Netty includes an implementation of the reactor pattern of programming. Originally developed by JBoss, Netty is now developed and maintained by the Netty Project Community. Besides being an asynchronous network application framework, Netty also includes built-in implementations of SSL/ TLS, HTTP, HTTP/2, HTTP/3, WebSockets, DNS, Protocol Buffers, SPDY and other protocols. Netty is not a Java web container, but is able to run inside one, and supports message compression. Netty has been actively developed since 2004. Beginning with version 4.0.0, Netty also supports the usage of NIO.2 as a backend, along with NIO and blocking Java sockets. See also * Application server * Node.js * Twisted (so ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Austrian Institute Of Technology
AIT Austrian Institute of Technology is Austria's largest Research and Technology Organization (RTO), employing about 1,300 people mostly based at the main facilities Vienna Tech Gate, Vienna TECHbase, Seibersdorf, Wiener Neustadt, Ranshofen and Graz. In June 2009 the name was changed from Austrian Research Centers (ARC) to AIT Austrian Institute of Technology GmbH. It is owned by the Republic of Austria (through the Ministry of Transport with 50.46% and by the Federation of Austrian Industries with 49.54%). The managing directors are Anton Plimon and Wolfgang Knoll. Organization Centers The company is structured in eight Centers: * Energy * Health & Bioresources * Digital Safety & Security * Vision, Automation & Control * Mobility Systems * Low-Emission Transport * Technology Experience * Innovation Systems & Policy Subsidiaries AIT has the following wholly owned subsidiaries: * Seibersdorf Labor GmbH * Nuclear Engineering Seibersdorf GmbH * Leichtmetallkompetenzzentrum Ran ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Secure Multi-party Computation
Secure multi-party computation (also known as secure computation, multi-party computation (MPC) or privacy-preserving computation) is a subfield of cryptography with the goal of creating methods for parties to jointly compute a function over their inputs while keeping those inputs private. Unlike traditional cryptographic tasks, where cryptography assures security and integrity of communication or storage and the adversary is outside the system of participants (an eavesdropper on the sender and receiver), the cryptography in this model protects participants' privacy from each other. The foundation for secure multi-party computation started in the late 1970s with the work on mental poker, cryptographic work that simulates game playing/computational tasks over distances without requiring a trusted third party. Note that traditionally, cryptography was about concealing content, while this new type of computation and protocol is about concealing partial information about data while comp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shamir's Secret Sharing
Shamir's Secret Sharing (SSS) is an efficient secret sharing algorithm for distributing private information (the "secret") in such a way that no individual holds intelligible information about the secret. To achieve this, the secret is converted into parts (the "shares") from which the secret can be reassembled when a sufficient number of shares are combined but not otherwise. SSS has the unusual property of information theoretic security, meaning an adversary without enough shares cannot reconstruct the secret even with infinite time and computing capacity. A standard SSS specification for cryptocurrency wallets has been widely implemented. High-level explanation SSS is used to secure a secret in a distributed way, most often to secure other encryption keys. The secret is split into multiple shares, which individually do not give any information about the secret. To unlock a secret secured by SSS a minimum number of shares are needed, called the ''threshold''. No additional in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
