Sciweavers

930 search results - page 71 / 186
» A Universal Encryption Standard
Sort
View
JAR
2000
145views more  JAR 2000»
13 years 9 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
FOCS
2008
IEEE
13 years 11 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
CCS
2007
ACM
14 years 4 months ago
Split-ballot voting: everlasting privacy with distributed trust
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...
Tal Moran, Moni Naor
IJNSEC
2008
164views more  IJNSEC 2008»
13 years 10 months ago
Secure Real-Time Streaming Protocol (RTSP) for Hierarchical Proxy Caching
Proxies are commonly used to cache objects, especially multimedia objects, so that clients can enjoy better quality-of-service (QoS) guarantees such as smaller startup latency and...
Yeung Siu Fung, John C. S. Lui, David K. Y. Yau
CSL
2010
Springer
13 years 11 months ago
Graded Computation Tree Logic with Binary Coding
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
Alessandro Bianco, Fabio Mogavero, Aniello Murano