Sciweavers

570 search results - page 82 / 114
» Black-box constructions for secure computation
Sort
View
ACISP
2007
Springer
13 years 12 months ago
A New Strategy for Finding a Differential Path of SHA-1
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
Jun Yajima, Yu Sasaki, Yusuke Naito, Terutoshi Iwa...
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 8 months ago
New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly ve...
Damien Vergnaud
IACR
2011
152views more  IACR 2011»
12 years 7 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
SC
2005
ACM
14 years 1 months ago
The Globus Striped GridFTP Framework and Server
The GridFTP extensions to the File Transfer Protocol define a general-purpose mechanism for secure, reliable, high-performance data movement. We report here on the Globus striped ...
William E. Allcock, John Bresnahan, Rajkumar Ketti...
RTA
2005
Springer
14 years 1 months ago
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code
Proof-carrying code provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set ...
Amy P. Felty