Sciweavers

2432 search results - page 65 / 487
» Cryptographic logical relations
Sort
View
CRYPTO
2001
Springer
145views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Pseudorandomness from Braid Groups
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other...
Eonkyung Lee, Sangjin Lee, Sang Geun Hahn
ISW
2001
Springer
15 years 2 months ago
An Auditable Metering Scheme for Web Advertisement Applications
This paper proposes a cryptographic mechanism for metering the duration and/or the number of instances of running a data process. This mechanism has the following property: knowing...
Liqun Chen, Wenbo Mao
CTRSA
2009
Springer
106views Cryptology» more  CTRSA 2009»
15 years 1 months ago
Communication-Efficient Private Protocols for Longest Common Subsequence
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
CTRSA
2008
Springer
109views Cryptology» more  CTRSA 2008»
14 years 12 months ago
Super-Efficient Verification of Dynamic Outsourced Databases
We develop new algorithmic and cryptographic techniques for authenticating the results of queries over databases that are outsourced to an untrusted responder. We depart from previ...
Michael T. Goodrich, Roberto Tamassia, Nikos Trian...
JAL
1998
74views more  JAL 1998»
14 years 9 months ago
A Survey of Fast Exponentiation Methods
Public-key cryptographic systems often involve raising elements of some group (e.g. GF(2n), Z/NZ, or elliptic curves) to large powers. An important question is how fast this expon...
Daniel M. Gordon