Browsing
     by title


0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:   
OK
Full Text
Peer Reviewed
See detailVerifiability of Helios Mixnet
Smyth, Benjamin UL

in Voting'18: 3rd Workshop on Advances in Secure Electronic Voting (2018)

Detailed reference viewed: 73 (0 UL)
Full Text
Peer Reviewed
See detailA Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing
Boyen, Xavier; Haines, Thomas; Mueller, Johannes UL

in Computer Security - ESORICS 2020 - 25th European Symposium on Research in Computer Security, ESORICS 2020, Guildford, UK, September 14-18, 2020, Proceedings, Part II (2020)

Detailed reference viewed: 27 (1 UL)
Full Text
Peer Reviewed
See detailVerifiable Inner Product Encryption Scheme
Soroush, Najmeh UL; Iovino, Vincenzo; Rial, Alfredo UL et al

in Public-Key Cryptography – PKC 2020 (2020)

Detailed reference viewed: 97 (4 UL)
Full Text
Peer Reviewed
See detailVerifiable postal voting
Ryan, Peter UL; Benaloh, Josh; Teague, Vanessa

in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013)

This proposal aims to combine the best properties of paper-based and end-to-end verifiable remote voting systems. Ballots are delivered electronically to voters, who return their votes on paper together ... [more ▼]

This proposal aims to combine the best properties of paper-based and end-to-end verifiable remote voting systems. Ballots are delivered electronically to voters, who return their votes on paper together with some cryptographic information that allows them to verify later that their votes were correctly included and counted. We emphasise the ease of the voter's experience, which is not much harder than basic electronic delivery and postal returns. A typical voter needs only to perform a simple check that the human-readable printout reflects the intended vote. The only extra work is adding some cryptographic information into the same envelope as the human-readable vote. The proposed scheme is not strictly end-to-end verifiable, because it depends on procedural assumptions at the point where the ballots are received. These procedures should be public and could be enforced by a group of observers, but are not publicly verifiable afterwards by observers who were absent at the time. [less ▲]

Detailed reference viewed: 167 (2 UL)
Full Text
Peer Reviewed
See detailVerifiable Voting Systems
Ryan, Peter UL; Peacock, Thea; Schneider, Steve et al

in Computer and Information Security Handbook (2013)

The introduction of technology into voting systems can bring a number of benefits, such as improving accessibility, remote voting, and efficient, accurate processing of votes. A voting system that uses ... [more ▼]

The introduction of technology into voting systems can bring a number of benefits, such as improving accessibility, remote voting, and efficient, accurate processing of votes. A voting system that uses electronic technology in any part of processing the votes, from vote capture and transfer through to vote tallying, is known as an e-voting system. In addition to the undoubted benefits, the introduction of such technology introduces particular security challenges, some of which are unique to voting systems because of their specific nature and requirements. The key role that voting systems play in democratic elections means that such systems must not only be secure and trustworthy, but must be seen by the electorate to be secure and trustworthy. This chapter emphasizes the challenge to reconcile the secrecy of the ballot, with demonstrable correctness of the result. © 2013 Copyright © 2013 Elsevier Inc. All rights reserved. [less ▲]

Detailed reference viewed: 130 (1 UL)
Full Text
Peer Reviewed
See detailVerification and abstraction of real-time variability-intensive systems
Cordy, Maxime UL; Legay, Axel

in International Journal on Software Tools for Technology Transfer (2019), 21(6), 635-649

Detailed reference viewed: 35 (0 UL)
Full Text
Peer Reviewed
See detailVerification and Implementation of Pseudo-Random-Binary-Sequences for Online Determination of Grid Impedance Spectrum
Tewari, Udit; Neshvad, Surena UL; Sachau, Jürgen UL

in The Renewable Energy & Power Quality Journal (2015, March 25)

The number of inverter based distributed power generators connected to the power network has rapidly grown in recent years. The consequence of this phenomenon is an increasingly complex distribution grid ... [more ▼]

The number of inverter based distributed power generators connected to the power network has rapidly grown in recent years. The consequence of this phenomenon is an increasingly complex distribution grid, requiring advanced and intelligent monitoring and observation tools in order to guarantee satisfactory power quality and reliability. This paper describes a novel power line impedance estimation method, implementing an innovative technique based on modifications of the Pulse Width Modulator’s pulse pattern on the inverters, in order to generate Pseudo-Random Binary Sequence based pilot signals. The stimuli are generated at different locations in the distribution grid, and detected at the transformer sub-station through cross correlation between the received distorted signal and the sequence, the parameters of the propagation channel can be estimated. Simulations in typical grid situations verify that the proposed algorithm is robust to a realistic environment and would [less ▲]

Detailed reference viewed: 119 (3 UL)
Full Text
Peer Reviewed
See detailVérification et test pour des systemes évolutifs
Fourneret, Elizabeta UL; Bouquet, Fabrice; Ochoa, Martìn et al

in Congrès Approches Formelles dans l'Assistance au Développement de Logiciels (2012, January)

Detailed reference viewed: 26 (2 UL)
Full Text
Peer Reviewed
See detailA verification framework for stateful security protocols
Li, Li; Dong, Naipeng; Pang, Jun UL et al

in Proceedings of the 19th International Conference on Formal Engineering Methods (2017)

Detailed reference viewed: 122 (1 UL)
Full Text
Peer Reviewed
See detailVerification of a key-chain based TTP transparent CEM protocol
Liu, Z.; Pang, Jun UL; Zhang, C.

in Proc. 3rd Workshop on Harnessing Theories for Tool Support in Software (2011)

Detailed reference viewed: 49 (2 UL)
Full Text
Peer Reviewed
See detailVerification of a key-chain based TTP transparent CEM protocol
Liu, Zhiyuan UL; Pang, Jun UL; Zhang, Chenyi UL

in Proceedings of the 3rd Workshop on Harnessing Theories for Tool Support in Software (2011), ENTCS 274

Detailed reference viewed: 91 (4 UL)
Full Text
See detailVerification of automotive networks - what to expect (and not expect) from each technique
Navet, Nicolas UL

Scientific Conference (2013, December 09)

The presentation focuses on the verification of wired automotive buses and addresses the following topics: historical perspective of verification techniques, review of the different sets of messages and ... [more ▼]

The presentation focuses on the verification of wired automotive buses and addresses the following topics: historical perspective of verification techniques, review of the different sets of messages and verification techniques along the development cycle, performance metrics and end-to-end constraints, early stage verification technique: schedulability analysis versus simulation. [less ▲]

Detailed reference viewed: 68 (2 UL)
Full Text
Peer Reviewed
See detailVerification of Data Location in Cloud Networking
Ries, Thorsten UL; Fusenig, Volker UL; Vilbois, Christian UL et al

in IEEE/ACM International Conference on Utility and Cloud Computing (2011)

Cloud computing aims to provide services and resources on a pay-as-you-use basis with additional possibilities for efficient adaptation of the required resources to the actual needs. Cloud networking ... [more ▼]

Cloud computing aims to provide services and resources on a pay-as-you-use basis with additional possibilities for efficient adaptation of the required resources to the actual needs. Cloud networking extends this approach by providing more flexibility in the placement, movement, and interconnection of these virtual resources. Depending on the use, customers however require the data to be located under a certain jurisdiction. To ensure this without the need of trusting the cloud operator, we propose a geolocation approach based on network coordinate systems and evaluate the accuracy of three prevalent systems. Even if the cloud operator uses supplemental measures like traffic relaying to hide the resource location, a high probability of location disclosure is achieved by the means of supervised classification algorithms. [less ▲]

Detailed reference viewed: 124 (1 UL)
Full Text
Peer Reviewed
See detailVerification of functional and non-functional requirements of web service composition
Chen, Manman; Tan, Tian Huat; Sun, Jun et al

in Proceedings of 15th Conference on Formal Engineering Methods (ICFEM'13) (2013)

Detailed reference viewed: 103 (0 UL)
Full Text
Peer Reviewed
See detailVerification of population ring protocols in PAT
Liu, Y.; Pang, Jun UL; Sun, J. et al

in Proc. 3rd IEEE Symposium on Theoretical Aspects of Software Engineering (2009)

Detailed reference viewed: 105 (1 UL)
Full Text
See detailVerification of the Quillen conjecture in the rank 2 imaginary quadratic case
Rahm, Alexander UL; Bui, Anh Tuan

E-print/Working paper (n.d.)

We confirm a conjecture of Quillen in the case of the mod 2 cohomology of arithmetic groups SL_2(A[1/2]), where A is an imaginary quadratic ring of integers. To make explicit the free module structure on ... [more ▼]

We confirm a conjecture of Quillen in the case of the mod 2 cohomology of arithmetic groups SL_2(A[1/2]), where A is an imaginary quadratic ring of integers. To make explicit the free module structure on the cohomology ring conjectured by Quillen, we compute the mod 2 cohomology of SL_2(Z[sqrt(−2)][1/2]) via the amalgamated decomposition of the latter group. [less ▲]

Detailed reference viewed: 60 (1 UL)
Full Text
Peer Reviewed
See detailA verification-driven framework for iterative design of controllers
Menghi, Claudio UL; Spoletini, Paola; Chechik, Marsha et al

in Formal Aspects of Computing (2019), 31

Controllers often are large and complex reactive software systems and thus they typically cannot be developed as monolithic products. Instead, they are usually comprised of multiple components that ... [more ▼]

Controllers often are large and complex reactive software systems and thus they typically cannot be developed as monolithic products. Instead, they are usually comprised of multiple components that interact to provide the desired functionality. Components themselves can be complex and in turn be decomposed into multiple sub-components. Designing such systems is complicated and must follow systematic approaches, based on recursive decomposition strategies that yield a modular structure. This paper proposes FIDDle–a comprehensive verification-driven framework which provides support for designers during development. FIDDle supports hierarchical decomposition of components into sub-components through formal specification in terms of pre- and post-conditions as well as independent development, reuse and verification of sub-components. The framework allows the development of an initial, partially specified design of the controller, in which certain components, yet to be defined, are precisely identified. These components can be associated with pre- and post-conditions, i.e., a contract, that can be distributed to third-party developers. The framework ensures that if the components are compliant with their contracts, they can be safely integrated into the initial partial design without additional rework. As a result, FIDDle supports an iterative design process and guarantees correctness of the system at any step of development. We evaluated the effectiveness of FIDDle in supporting an iterative and incremental development of components using the K9 Mars Rover example developed at NASA Ames. This can be considered as an initial, yet substantive, validation of the approach in a realistic setting. We also assessed the scalability of FIDDle by comparing its efficiency with the classical model checkers implemented within the LTSA toolset. Results show that FIDDle scales as well as classical model checking as the number of the states of the components under development and their environments grow. [less ▲]

Detailed reference viewed: 88 (19 UL)
Full Text
Peer Reviewed
See detailA verified algebra for read-write Linked Data
Horne, Ross James UL; Sassone, Vladimiro

in Science of Computer Programming (2014), 89

Detailed reference viewed: 79 (1 UL)
Full Text
Peer Reviewed
See detailA Verified Theorem Prover Backend Supported by a Monotonic Library
Rahli, Vincent UL; Cohen, Liron; Bickford, Mark

in LPAR 2018 (2018)

Detailed reference viewed: 106 (6 UL)
Full Text
Peer Reviewed
See detailVerifying Agents with Memory Is Harder than It Seemed
Bulling, N.; Jamroga, Wojciech UL

in AI Communications (2010), 23

Detailed reference viewed: 68 (2 UL)