• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 36
Next 10 →

The Security Power of the Ballot Box

by Matt Lepinski, Silvio Micali , 2005
"... We show that any function f can be securely evaluated by a protocol with ballots and a ballot box. That is, n mutually suspicious players, each player i possessing a secret input xi, can use ballots and ballot boxes to jointly evaluate f(x1,..., xn) = (y1,..., yn), so that (no matter how many playe ..."
Abstract - Add to MetaCart
We show that any function f can be securely evaluated by a protocol with ballots and a ballot box. That is, n mutually suspicious players, each player i possessing a secret input xi, can use ballots and ballot boxes to jointly evaluate f(x1,..., xn) = (y1,..., yn), so that (no matter how many

General Statistically Secure Computation with Bounded-Resettable Hardware Tokens

by Daniel Kraschewski, Tobias Nilges
"... Universally composable secure computation was assumed to require trusted setups, until it was realized that parties exchanging (untrusted) tamper-proof hardware tokens allow an alter-native approach (Katz; EUROCRYPT 2007). This discovery initialized a line of research dealing with two different type ..."
Abstract - Add to MetaCart
of statistically secure and universally composable similarities to previous solutions, which we grasp by defining a new security property for pro-tocols that use oracle access. Additionally, we apply our techniques to zero-knowledge proofs and obtain a protocol that achieves the same properties as bounded

S-QoS: A Secure Quality of Service Web Service Mechanism Using 3 rd Party Certifications to Enable Trustworthy Relationships among Service Producers and Consumers

by Phil Bonderud
"... The purpose of this capstone project is to propose a mechanism through which Web Services consumers and providers can establish a trustworthy relationship with respect to their own interests, prior to engaging in a service agreement. The process addresses issues represented in current Quality of Ser ..."
Abstract - Add to MetaCart
of Service (QoS) and Security related Web Services research and draws upon common concerns between the two to compose a solution to current unresolved Universal Description, Discovery, and Integration (UDDI) issues. The first approach, prior to Summer 2006 foundational work proposed the creation

Towards Secure Electronic Workflows Examples of Applied PKI Supervisor:

by Sebastian Fritsch, Dipl Ing, Vangelis Karatsiolis Erklärung , 2006
"... Hiermit versichere ich, die vorliegende Diplomarbeit selbstständig und unter ausschliesslicher Verwendung der angegebenen Quellen und Hilfsmittel angefertigt zu haben. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbehörde vorgelegen. Darmstadt, 14. Februar 2006 ..."
Abstract - Add to MetaCart
Hiermit versichere ich, die vorliegende Diplomarbeit selbstständig und unter ausschliesslicher Verwendung der angegebenen Quellen und Hilfsmittel angefertigt zu haben. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbehörde vorgelegen. Darmstadt, 14. Februar 2006

MIT-LCS-TM-647 The Security Power of the Ballot Box

by Matt Lepinski, Sergei Izmalkov, Matt Lepinski, Silvio Micali , 2005
"... We show that any function f can be securely evaluated by a pro-tocol with ballots and a ballot box. That is, n mutually suspicious players, each player i possessing a secret input xi, can use ballots and ballot boxes to jointly evaluate f(x1,..., xn) = (y1,..., yn), so that (no matter how many play ..."
Abstract - Add to MetaCart
We show that any function f can be securely evaluated by a pro-tocol with ballots and a ballot box. That is, n mutually suspicious players, each player i possessing a secret input xi, can use ballots and ballot boxes to jointly evaluate f(x1,..., xn) = (y1,..., yn), so that (no matter how many

Title of Document: QUANTUM MECHANICS AND QUANTUM INFORMATION THEORY

by unknown authors
"... The principle aim of this dissertation is to investigate the philosophical application of quantum information theory to interpretational issues regarding the theory of quantum mechanics. Recently, quantum information theory has emerged as a potential source for such an interpretation. The main quest ..."
Abstract - Add to MetaCart
The principle aim of this dissertation is to investigate the philosophical application of quantum information theory to interpretational issues regarding the theory of quantum mechanics. Recently, quantum information theory has emerged as a potential source for such an interpretation. The main

ii List of Publications

by Vom Fachbereich Informatik Der, Technischen Universität Darmstadt Genehmigte, Referenten Prof, Dr. Johannes Buchmann, Tag Der Mündlichen Prüfung, Hochschulkennziffer D, Denise Demirel, Maria Henning, Jeroen Van De Graaf, Peter Y. A. Ryan, Johannes Buchmann, In Vote-id, Th International Conference , 2014
"... pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publicly-verifiable mix-net providing everlasting privacy. In Financial Cryptog-raphy, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios ..."
Abstract - Add to MetaCart
pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publicly-verifiable mix-net providing everlasting privacy. In Financial Cryptog-raphy, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios

A New Family of Practical Non-Malleable Protocols

by Andrew C. Yao, et al. , 2011
"... Nowadays, achieving cryptosystems secure in an asynchronous network like the Internet is demanded to be necessary, where concurrent non-malleable proof-of-knowledge and universal composability are among the most powerful and fundamental security properties. But, when achieving more and more complex ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Nowadays, achieving cryptosystems secure in an asynchronous network like the Internet is demanded to be necessary, where concurrent non-malleable proof-of-knowledge and universal composability are among the most powerful and fundamental security properties. But, when achieving more and more complex

Taipei TW

by Chia-hsin Owen Chen, Chung-wei Chen, Cynthia Kuo, Yan-hao Lai, Jonathan M. Mccune, National Tsing Hua, Taichung Tw
"... Establishing secure communication among a group of physically collocated people is a challenge. This problem can be reduced to establishing authentic public keys among all the participants – these public keys then serve to establish a shared secret symmetric key for encryption and authentication of ..."
Abstract - Add to MetaCart
of messages. Unfortunately, in most real-world settings, public key infrastructures (PKI) are uncommon and distributing a secret in a public space is difficult. Thus, it is a challenge to exchange authentic public keys in a scalable, secure, and easy to use fashion. In this paper, we propose GAnGS, a protocol

A Study of User-Friendly Hash Comparison Schemes

by unknown authors
"... Abstract—Several security protocols require a human to compare two hash values to ensure successful completion. When the hash values are represented as long sequences of numbers, humans may make a mistake or require significant time and patience to accurately compare the hash values. To improve usab ..."
Abstract - Add to MetaCart
Abstract—Several security protocols require a human to compare two hash values to ensure successful completion. When the hash values are represented as long sequences of numbers, humans may make a mistake or require significant time and patience to accurately compare the hash values. To improve
Next 10 →
Results 1 - 10 of 36
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University